Algebraic theory of block codes detecting independent errors
From MaRDI portal
Publication:1132060
DOI10.1007/BF01084252zbMath0418.94011OpenAlexW2051067291MaRDI QIDQ1132060
Publication date: 1976
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01084252
Reed-Muller codesbibliographyconcatenated codesGoppa codescyclic codesblock codesAbelian group codesBch codesbounds of cardinalityconstraints of weight spectraperfect and uniformly packed codespolynomial codessurvey of algebraic coding theory
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- A theorem on equidistant codes
- Factorization of polynomials over finite fields
- Weight enumerators of self-orthogonal codes
- A necessary condition for the existence of perfect codes in Lie metric
- On weights in quadratic-residue codes
- Contractions of self-orthogonal codes
- Unrestricted codes with the Golay parameters are unique
- Perfect codes and the Mathieu groups
- A vector-space packing problem
- On the Golay perfect binary code
- On periodic sequences from \(GF(q)\)
- Orthogonal circulant matrices over finite fields, and how to find them
- Symmetry codes over GF(3) and new five-designs
- Euler products, cyclotomy, and coding
- Codes with simple automorphism groups
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- Weights of linear codes and strongly regular normed spaces
- Cyclotomic numbers, coding theory and orthogonal polynomials
- Good self dual codes exist
- Two theorems on perfect codes
- Nearly perfect binary codes
- Upper bounds for constant weight error correcting codes
- On the existence of a projective plane of order 10
- A construction scheme for linear and non-linear codes
- A classification of self-orthogonal codes over GF(2)
- Goppa codes
- A search technique for quasi-perfect codes
- A note on the decomposition of cyclic codes into cyclic classes
- A class of low-rate nonlinear binary codes
- A note on a result in the theory of code construction
- A Metrization for Power-Sets with Applications to Combinatorial Analysis
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- Linear Recurring Sequences
- Two-error correcting Bose-Chaudhuri codes are quasi-perfect
- Polynomial Codes Over Certain Finite Fields
- A note on cyclic permutation error-correcting codes
- On a class of error correcting binary group codes
- Further results on error correcting binary group codes
- A 32-point n=12, d=5 code (Corresp.)
- On the number of information symbols in Bose-Chaudhuri codes
- Binary self-dual codes of length 24
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Construction and decomposition of cyclic codes of composite length (Corresp.)
- A low-rate improvement on the Elias bound (Corresp.)
- The MacWilliams Identities for Nonlinear Codes
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
- Some long cyclic linear binary codes are not so bad
- On the structure of generalized finite-geometry codes
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- Semisimple cyclic and Abelian codes. II
- Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)
- A new theorem about the Mattson-Solomon polynomial, and some applications
- Improved asymptotic bounds for error-correcting codes
- A modification of the constructive asymptotically good codes of Justesen for low rates
- Shortened BCH codes (Corresp.)
- A self-dual even (96, 48, 16) code (Corresp.)
- On some classes of cyclic codes of composite length (Corresp.)
- Four fundamental parameters of a code and their combinatorial significance
- Justesen's construction--The low-rate case (Corresp.)
- Self-dual codes over gf(q) satisfy a modified varshamov-gilbert bound
- On the fractional weight of distinct binary<tex>n</tex>-tuples (Corresp.)
- On an extended class of error-locating codes
- The Structure and Properties of Binary Cyclic Alphabets
- On codes derivable from the tensor product of check matrices
- Cyclic product codes
- A New Treatment of Bose-Chaudhuri Codes
- Reversible codes
- Analysis of weight distribution in binary cyclic codes (Corresp.)
- Some Sphere Packings in Higher Space
- Some Factorizations of 2 n ± 1 and Related Results
- Self-orthogonal quasi-cyclic codes
- Algebraically punctured cyclic codes
- Some additional upper bounds for fixed-weight codes of specified minimum distance
- Power moment identities on weight distributions in error correcting codes
- A class of majority logic decodable codes (Corresp.)
- Cyclic error-locating codes
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Long BCH codes are bad
- On a class of majority-logic decodable cyclic codes
- An optimum nonlinear code
- A New Class of Cyclic Codes
- Notes on Sphere Packings
- On linear and nonlinear single-error-correcting q-nary perfect codes
- Graph theoretic error-correcting codes
- New generalizations of the Reed-Muller codes--I: Primitive codes
- New generalizations of the Reed-Muller codes--II: Nonprimitive codes
- Factorization of cyclic codes
- On primitive trinomials (Mod 2)
- On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
- On the solution of algebraic equations over finite fields
- On the Number of Information Symbols in Difference-Set Cyclic Codes
- Some lower bounds on the minimum weight of cyclic codes of composite length
- Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes
- New binary coding results by circulants
- A class of optimum nonlinear double-error-correcting codes
- An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
- On the p-rank of the design matrix of a difference set
- Weight and distance structure of Nordstrom-Robinson quadratic code
- Some results on cyclic codes which are invariant under the affine group and their applications
- On the uniqueness of the Golay codes
- A geometric approach to a class of cyclic codes
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
- The Enumeration of Information Symbols in BCH Codes
- Weights of cyclic codes
- Limit distribution of the minimum distance of random linear codes
- New 5-designs
- Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
- Restrictions on weight distribution of Reed-Muller codes
- On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes
- On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
- Some results on quasi-cyclic codes
- On a new family of symmetry codes and related new five-designs
- Further results on polynomial codes
- On tactical configurations and error-correcting codes
- Nonbinary random error-correcting codes (Corresp.)
- Maximal Group Codes with Specified Minimum Distance
- New sphere packings in dimensions 9-15
- Some Mathematical Properties of a Scheme for Reducing the Bandwidth of Motion Pictures by Hadamard Smearing
- On the weight distribution of cyclic codes (Corresp.)
- On the symmetry of good nonlinear codes
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- Further results on cyclic product codes
- On the weight structure of Reed-Muller codes
- Weight enumerator for second-order Reed-Muller codes
- On Group and Nongroup Perfect Codes in $q$ Symbols.
- On Binary Cyclic Codes Which are Also Cyclic Codes Over $GF(2^s )$
- On the nonexistence of perfect 2- and 3-hamming-error-correcting codes over GF(q)
- A new look at the Golay (23, 12) code (Corresp.)
- New family of single-error correcting codes
- BCH Bounds for a Class of Cyclic Codes
- Sphere Packings and Error-Correcting Codes
- On cyclic codes that are invariant under the general linear group
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
- Polynomial codes
- On the theory of group codes
- Coding theory and the Mathieu groups
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- On majority-logic decoding for duals of primitive polynomial codes
- Reachable sets for linear dynamical systems
- On majority-logic decoding of finite geometry codes
- On the decomposition of cyclic codes into cyclic classes
- A bound for cyclic codes of composite length (Corresp.)
- Weight distributions of the cosets of the (32,6) Reed-Muller code
- A note on the minimum distance structure of cyclic codes (Corresp.)
- Srivastava codes
- On upper bounds for unrestricted binary-error-correcting codes
- On the Nonexistence of Perfect Codes over Finite Fields
- A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
- Long primitive binary BCH codes have distance<tex>d leq 2n ln R^{-1}/log n cdots</tex>
- Analysis and synthesis of polynomials and sequences over<tex>GF(2)</tex>
- Gleason's theorem on self-dual codes
- On Finding Low Weight Vectors in Quadratic Residue Codes for $p = 8m - 1$
- Weights of irreducible cyclic codes
- Decoding beyond the BCH bound (Corresp.)
- Coset analysis of reed muller codes via translates of finite vector spaces
- Generalizations of the BCH bound
- Some results on the minimum distance structure of cyclic codes
- Note on majority-logic decoding of finite geometry codes (Corresp.)
- Shortened finite geometry codes (Corresp.)
- New binary codes
- A new description of the Nadler code (Corresp.)
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- Factoring Polynomials Over Large Finite Fields
- Polynomial weights and code constructions
- Is there a (72,36) d = 16 self-dual code? (Corresp.)
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- Number of information symbols in polynomial codes
- Sphere packings constructed from BCH and Justesen codes
- An upper bound for self-dual codes
- Polynômes des poids de certains codes et fonctions thêta de certains réseaux
- Class of constructive asymptotically good algebraic codes
- Noncyclic generalizations of BCH and srivastava codes
- Minimum-distance bounds for binary linear codes
- Multifold Euclidean geometry codes
- Circulant bases for cyclic codes (Corresp.)
- On generalized ReedMuller codes and their relatives
- Augmentation techniques for a class of product codes
- A (48, 31, 8) linear code (Corresp.)
- Coding and Combinatorics
- A weight formula for group codes
- Upper bounds for fixed-weight codes of specified minimum distance (Corresp.)
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Maximum distance<tex>q</tex>-nary codes
- Orthogonal Arrays of Index Unity
- Orthogonal Arrays of Strength two and three
- Coding theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algebraic theory of block codes detecting independent errors
