Two new nonlinear binary codes
From MaRDI portal
Recommendations
Cited in
(29)- Binary codes with a minimum distance of four (Corresp.)
- A new class of binary codes constructed on the basis of BCH codes (Corresp.)
- New lower bounds on \(q\)-ary error-correcting codes
- New binary codes
- New binary linear codes which are dual transforms of good codes
- Square designs on a family of new binary \(\left(\frac{p^n-1}{p-1},\frac{p^n-1}{p-1}, 2p^{n-2}\right)\) codes
- New binary codes constructed by an old technique (Corresp.)
- scientific article; zbMATH DE number 3882342 (Why is no real title available?)
- Two-level screening designs derived from binary nonlinear codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- scientific article; zbMATH DE number 1792627 (Why is no real title available?)
- Two new four-error-correcting binary codes
- An optimum nonlinear code
- On a new code, \([2^n - 1,n,2^{n - 1}]\)
- A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
- Constructing error-correcting binary codes using transitive permutation groups
- scientific article; zbMATH DE number 1189041 (Why is no real title available?)
- New binary codes from extended Goppa codes
- Nonlinear Population Codes
- New binary codes from a chain of cyclic codes
- An exotic binary code
- A new two-error-correcting binary code of length 16
- scientific article; zbMATH DE number 3487350 (Why is no real title available?)
- New binary linear codes
- New binary codes from a generalization of Zinoviev's technique
- On optimal binary codes with unbalanced coordinates
- A simple proof of the improved Johnson bound for binary codes
- Square designs on new binary \(\left(\frac{3^n-1}{2}, \frac{3^n-1}{2}, 2.3^{n-2}\right)\) codes
- New $[47,15,16]$ Linear Binary Block Code
This page was built for publication: Two new nonlinear binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546840)
