On the maximum length of coil-in-the-box codes in dimension 8
From MaRDI portal
(Redirected from Publication:477349)
Recommendations
- New bounds on binary linear codes of dimension eight (Corresp.)
- Some new bounds for the maximum length of circuit codes (Corresp.)
- On optimal linear codes over \(\mathbb F_8\)
- scientific article; zbMATH DE number 1188987
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- The maximum length of circuit codes with long bit runs and a new characterization theorem
- Structure of repeated-root constacyclic codes of length \(8 \ell^m p^n\)
- scientific article; zbMATH DE number 4160649
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- NMDS codes of maximal length over F/sub q/,8≤q≤11
Cites work
- scientific article; zbMATH DE number 6519645 (Why is no real title available?)
- scientific article; zbMATH DE number 4160774 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 871181 (Why is no real title available?)
- A new lower bound for snake-in-the-box codes
- An upper bound on the size of the snake-in-the-box
- Classification algorithms for codes and designs
- Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
- Isomorph-Free Exhaustive Generation
- Snake-in-the-Box Codes for Rank Modulation
- Some new circuit codes
- Switching codes and designs
Cited in
(4)
This page was built for publication: On the maximum length of coil-in-the-box codes in dimension 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477349)