Bounds on codes over an alphabet of five elements
From MaRDI portal
Publication:5948966
DOI10.1016/S0012-365X(00)00383-6zbMath1005.94032MaRDI QIDQ5948966
Patric R. J. Östergård, Galina T. Bogdanova
Publication date: 4 February 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Semidefinite bounds for nonbinary codes based on quadruples ⋮ Slight improvements of the Singleton bound ⋮ New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming ⋮ Detecting arrays for effects of single factors ⋮ On independent star sets in finite graphs ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ New nonbinary code bounds based on divisibility arguments ⋮ New upper bounds on Lee codes ⋮ The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles ⋮ New lower bounds on \(q\)-ary error-correcting codes
This page was built for publication: Bounds on codes over an alphabet of five elements
