Two new four-error-correcting binary codes
From MaRDI portal
Publication:2572972
DOI10.1007/s10623-004-1723-3zbMath1158.94419OpenAlexW2071547466MaRDI QIDQ2572972
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-1723-3
Related Items (5)
On optimal binary codes with unbalanced coordinates ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation
Cites Work
This page was built for publication: Two new four-error-correcting binary codes