Results 21 to 30 of about 77,850 (96)

The q-ary image of some qm-ary cyclic codes: permutation group and soft-decision decoding [PDF]

, 2002
Using a particular construction of generator matrices of the q-ary image of qm-ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups.
Delpeyroux, Emmanuelle, Lacan, Jérôme
core   +1 more source

Steiner t-designs for large t

, 2008
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L.
A. Betten, A. Delandtsheer, D. Gorenstein, D. Livingstone, D. Pei, D.G. Higman, D.K. Ray-Chaudhuri, D.R. Hughes, D.R. Stinson, D.R. Stinson, F. Buekenhout, F. Buekenhout, G.-C. Rota, H. Lüneburg, H. Wielandt, J. Saxl, J. Tits, J.D. Dixon, J.H. Conway, L. Teirlinck, M. Hall Jr., M. Huber, M. Huber, M. Huber, M. Huber, M.W. Liebeck, M.W. Liebeck, N.D. Tuan, P. Dembowski, P. Kaski, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, R.A. Fisher, R.E. Block, T.. Beth, W.C. Huffman, W.M. Kantor, W.M. Kantor   +40 more
core   +2 more sources

Trivial source bimodule rings for blocks and p-permutation equivalences [PDF]

, 2009
We associate with any p-block of a finite group a Grothendieck ring of certain p-permutation bimodules. We extend the notion of p-permutation equivalences introduced by Boltje and Xu [4] to source algebras of p-blocks of finite groups.
Linckelmann, M.
core   +1 more source

Pairwise transitive 2-designs [PDF]

, 2015
We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs, intersecting block ...
Devillers, Alice, Praeger, Cheryl E.
core   +1 more source

Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals

, 2013
Traditional compressed sensing considers sampling a 1D signal. For a multidimensional signal, if reshaped into a vector, the required size of the sensing matrix becomes dramatically large, which increases the storage and computational complexity ...
Fang, Hao, Jiang, Hai, Taheri, Omid, Vorobyov, Sergiy A.   +3 more
core   +1 more source

Generalizing Boolean Satisfiability III: Implementation

, 2011
This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers.
Dixon, H. E., Ginsberg, M. L., Hofer, D., Luks, E. M., Parkes, A. J.   +4 more
core   +1 more source

On the Cartan matrix of Mackey algebras [PDF]

, 2009
Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k.
Bouc, Serge
core   +1 more source

Algebraic properties of generalized Rijndael-like ciphers [PDF]

, 2012
We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition.
B. Scott, Cory, Kevin W. Bombardier, L. Babinkostova, Matthew M. Cole, Thomas A   +5 more
core  

Trivalent Graph isomorphism in polynomial time [PDF]

, 2012
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence
Mena, Adria Alcala
core   +2 more sources

Infinity-Norm Permutation Covering Codes from Cyclic Groups

, 2017
We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes.
Karni, Ronen, Schwartz, Moshe
core   +1 more source