Error-correcting codes over an alphabet of four elements
From MaRDI portal
Publication:5943691
DOI10.1023/A:1011275112159zbMath1011.94029OpenAlexW3122192503MaRDI QIDQ5943691
Galina T. Bogdanova, Patric R. J. Östergård, Andries E. Brouwer, Stoian N. Kapralov
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
Related Items (21)
Semidefinite bounds for nonbinary codes based on quadruples ⋮ Slight improvements of the Singleton bound ⋮ A construction of optimal constant composition codes ⋮ New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming ⋮ On independent star sets in finite graphs ⋮ Small additive quaternary codes. ⋮ There exists no (15,5,4) RBIBD ⋮ Good equidistant codes constructed from certain combinatorial designs ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem ⋮ New nonbinary code bounds based on divisibility arguments ⋮ NEW TERNARY AND QUATERNARY CONSTANT-WEIGHT EQUIDISTANT CODES ⋮ There exists no (15,5,4) RBIBD†* ⋮ New upper bounds on Lee codes ⋮ Linear constructions for DNA codes ⋮ The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles ⋮ Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound ⋮ Fundamentals of coding type problems ⋮ Miscellaneous classification results for 2-designs ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
This page was built for publication: Error-correcting codes over an alphabet of four elements