scientific article; zbMATH DE number 3999824

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

BCH codes perfect codes cyclic codes error correcting codes weight enumerators maximum distance separable codes error probability latin squares dual code Hamming codes syndrome decoding block coding parity check matrix random error correction encoding and decoding linear codes Extension fields

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (49)

Codes, not ciphers ⋮ One-error correcting [5, 2 ternary codes] ⋮ On the extendability of particular classes of constant dimension codes ⋮ An equivalence based classification of [6, 3, 4 error correcting codes over GF(5)] ⋮ New classes of self-complementary codes and quasi-symmetric designs ⋮ Multi-class learning by smoothed boosting ⋮ Perfect t-codes in Cayley graphs of groups ⋮ On codes over \(\mathrm{FFN}(1,q)\)-projective varieties ⋮ Optimal pseudo-cyclic codes and caps in \(PG(3,q)\) ⋮ The Use of Blocking Sets in Galois Geometries and in Related Research Areas ⋮ On Quinary [6,4 Error Correcting Codes] ⋮ On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre ⋮ Hydrological cycle algorithm for continuous optimization problems ⋮ Classical arcs in \(PG(r,q)\) for \(11\leq q\leq 19\) ⋮ On the Cayleyness of Praeger-Xu graphs ⋮ Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ Modelling constant weight codes using tabu search ⋮ Constacyclic and skew constacyclic codes over a finite commutative non-chain ring ⋮ Replicable functions arising from code-lattice VOAs fixed by automorphisms ⋮ Entanglement-assisted binary quantum codes from skew cyclic codes over \(\mathbb{F}_2\times(\mathbb{F}_2+v\mathbb{F}_2)\) ⋮ Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes ⋮ Divisible designs, Laguerre geometry, and beyond ⋮ The card game SET. ⋮ On the cogirth of binary matroids ⋮ Efficient \(k\)-distance dominating set in Cayley graphs ⋮ Some optimal codes from algebraic geometry and their covering radii ⋮ A note on the covering radius of optimum codes ⋮ Derivations on group algebras with coding theory applications ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ Linear codes close to the Griesmer bound and the related geometric structures ⋮ Improved partial permutation decoding for Reed-Muller codes ⋮ On linear codes admitting large automorphism groups ⋮ Lester Hill's Error-Detecting Codes ⋮ Multisecret-sharing schemes and bounded distance decoding of linear codes ⋮ The detection of double errors in ISBN- and ISSN-like codes ⋮ On Lagrangian-Grassmannian codes ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes ⋮ Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\) ⋮ Half-cyclic, dihedral and half-dihedral codes ⋮ Some generalizations of Rédei’s theorem ⋮ A STUDY ON EQUIVALENCE OF 1-ERROR CORRECTING [6, 2, 4 QUATERNARY CODES] ⋮ Rank Vertex Cover as a Natural Problem for Algebraic Compression ⋮ Perfect codes on the towers of Hanoi graph ⋮ Near-MDS codes arising from algebraic curves ⋮ Detection and correction of multiple errors in general block codes. ⋮ Quantum codes from cyclic codes over the mixed alphabet structure ⋮ On the covering radius of Reed-Solomon codes ⋮ Recovering erasures by using MDS codes over extension alphabets ⋮ Feedback linearly extended discrete functions

This page was built for publication: