Error-correcting codes over an alphabet of four elements

DOI10.1023/A:1011275112159MaRDI QIDQ5943691zbMATH OpenOpenAlexFDO

Authors Galina T. Bogdanova, Andries E. Brouwer, Stoyan Kapralov, Patric R. J. Östergård

Publication date 4 November 2001

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011275112159

zbMATH Keywords

bounds on codesnonlinear codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Review text

This papers presents bounds on the maximum size of a code of length \(n\) and minimum distance \(d\), denoted \(A_q(n,d)\). Combinatorial bounds are given, and it is determined when \(A_q(n,d) = M\) for \(q < M < 2q\). Numerous constructions are presented, and a table of the best known bounds on \(A_4(n,d)\) is given for \(n \leq 12\).

Recommendations

• scientific article; zbMATH DE number 1188984
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
• A new upper bound for binary codes with minimum distance four
• A new upper bound for single error-correcting codes
• New single-error-correcting codes

Cited in

(26)

• Small additive quaternary codes.
• New nonbinary code bounds based on divisibility arguments
• Linear constructions for DNA codes
• Miscellaneous classification results for 2-designs
• Slight improvements of the Singleton bound
• Error-correcting codes in attenuated space over finite fields
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
• Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
• New lower bounds on \(q\)-ary error-correcting codes
• Semidefinite bounds for nonbinary codes based on quadruples
• On independent star sets in finite graphs
• New upper bounds on Lee codes
• Two new four-error-correcting binary codes
• There exists no (15, 5, 4) RBIBD
• There exists no (15,5,4) RBIBD
• New ternary and quaternary constant-weight equidistant codes
• Fundamentals of coding type problems
• scientific article; zbMATH DE number 1188984 (Why is no real title available?)
• scientific article; zbMATH DE number 1504690 (Why is no real title available?)
• Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
• Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
• The k-distance independence number and 2-distance chromatic number of Cartesian products of cycles
• A maximum edge-weight clique extraction algorithm based on branch-and-bound
• A construction of optimal constant composition codes
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Good equidistant codes constructed from certain combinatorial designs

This page was built for publication: Error-correcting codes over an alphabet of four elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943691)