Bounds on codes over an alphabet of five elements

DOI10.1016/S0012-365X(00)00383-6MaRDI QIDQ5948966zbMATH OpenFDO

Authors Galina T. Bogdanova, Patric R. J. Östergård

Publication date 4 February 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00383-6

zbMATH Keywords

bounds on the cardinality of optimal codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Review text

Let \(C\) be an \((n, M, d)_q\) code; i.e. \(C\subseteq \mathbb{Z}_q^n\) is a linear code with minimum distance \(d\) and cardinality \(M\). Fixing the parameters \(n, d, q\), denote the largest possible value of \(M\) by \(A_q(n,d)\). Any \((n, M, d)_q\) code \(C\) for which \(M= A_q(n,d)\) is called optimal. NEWLINENEWLINENEWLINEAfter listing some results concerning the \(q\)-ary form of the Plotkin bound and optimal codes (details are to be found e.g. in [\textit{G. Bogdanova, A. Brouwer, S. Kapralov,} and \textit{P. Östergård}, Error-correcting codes over an alphabet of four elements, Des. Codes Cryptography 23, 333-342 (2001; Zbl 1011.94029)]), the authors look at three different constructions of codes that can be used to get some good lower bounds on \(A_5(n,d)\): a construction involving the Hamming code, one involving cyclic codes and the maximum-weight clique problem, and one involving a matrix construction. Using these methods, they compute upper and lower bounds for \(A_5(n,d), n\leq 11\), and provide the best known results.

Recommendations

• On optimal linear codes over \(\mathbb F_5\)
• Bounds on minimum distance for linear codes over GF(5)
• scientific article; zbMATH DE number 1188984
• Optimal quaternary linear codes of dimension five
• scientific article; zbMATH DE number 5054194

Cited in

(12)

• \(K_{5}(7,3) \leqslant 100\).
• New nonbinary code bounds based on divisibility arguments
• Slight improvements of the Singleton bound
• 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
• Bounds on the size of equidistant codes over an alphabet of five and six elements
• Detecting arrays for effects of single factors
• 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
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming

This page was built for publication: Bounds on codes over an alphabet of five elements

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