scientific article; zbMATH DE number 3499621
From MaRDI portal
Publication:4081121
zbMath0318.94009MaRDI QIDQ4081121
Ronald C. Mullin, Ian F. Blake
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx) Designs and configurations (05Bxx)
Related Items (59)
Existence of Abelian group code partitions ⋮ Large scale geometric programming: An application in coding theory ⋮ On algebraic structure of the Reed-Muller codes ⋮ Bounds on Distance Distributions in Codes of Given Size ⋮ Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes ⋮ On the number of rational points on codimension 1 algebraic sets in \(\mathbb{P}^ n (\mathbb{F}_ q)\) ⋮ A group algebra construction of binary even self dual codes ⋮ Characterization and synthesis of self-complementary normal bases in finite fields ⋮ On paving matroids and a generalization of MDS codes ⋮ Generalized Reed-Muller codes over \({\mathbb{Z}_q}\) ⋮ A note on the computation of the bit error rate for binary block codes ⋮ Self-dual lattices of type \(A\) ⋮ Steiner triple systems of order 15 and their codes ⋮ On the equivalence of certain constant weight codes and combinatorial designs ⋮ Theory and use of functionals on the class of nonnegative polynomials and quadrature formulae ⋮ The complexity of a periodic sequence over GF(p) ⋮ Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes ⋮ A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs ⋮ A note on universal classes of hash functions ⋮ On low weight codewords of generalized affine and projective Reed-Muller codes ⋮ The family of t-designs. Part I ⋮ Graphical designs and gale duality ⋮ A note on the construction of optimal linear codes ⋮ On completely regular codes ⋮ Zyklische lineare optimale (n,2)-Codes ⋮ Fuzzy codes and distance properties ⋮ The Minimum Distance of Graph Codes ⋮ Idempotents in group algebras and minimal abelian codes ⋮ \(t\)-sum generators of finite Abelian groups ⋮ A note about multidesigns and extended designs ⋮ Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) ⋮ The generating groups of geometrically uniform spherical signal sets ⋮ Ternary dual codes of the planes of order nine ⋮ Dimensions of hyperplane spaces over finite fields ⋮ Completely regular codes by concatenating Hamming codes ⋮ Codes projectifs à deux poids, caps complets et ensembles de différences ⋮ The circulant hash revisited ⋮ Pairwise Orthogonal generalized room squares and equidistant permutation arrays ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ On the structure of regular pairwise balanced designs ⋮ A linear-algebra problem from algebraic coding theory ⋮ A note on cyclic codes from APN functions ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry ⋮ Cyclic codes of length \(2^e\) over \(\mathbb Z_4\). ⋮ Cyclic codes over the integers modulo \(p^m\). ⋮ Minimal codes of prime-power length. ⋮ Elliptically embedded subgroups and nilpotent products ⋮ Constructions of optimal quaternary constant weight codes via group divisible designs ⋮ On Symmetric Representations of Finite Fields ⋮ Cohn's rings of zero divisors ⋮ Some techniques for constructing infinite families of BIBD's ⋮ Construction of optimal linear codes using flats and spreads in a finite projective geometry ⋮ The application of coding theory to the design of combinatorial filing schemes of any order ⋮ Duadic codes and difference sets ⋮ Some ring-theoretic properties of group algebras ⋮ A gluing technique for constructing relatively self-dual codes ⋮ On character sums and codes
This page was built for publication:
