On the maximum length of coil-in-the-box codes in dimension 8
From MaRDI portal
Publication:477349
DOI10.1016/J.DAM.2014.07.010zbMATH Open1303.05053OpenAlexW2010404904WikidataQ60692137 ScholiaQ60692137MaRDI QIDQ477349FDOQ477349
Authors: Patric R. J. Östergård, Ville H. Pettersson 
Publication date: 3 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.010
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
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classification algorithms for codes and designs
- Title not available (Why is that?)
- Isomorph-Free Exhaustive Generation
- Switching codes and designs
- A new lower bound for snake-in-the-box codes
- An upper bound on the size of the snake-in-the-box
- Snake-in-the-Box Codes for Rank Modulation
- Title not available (Why is that?)
- Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
- Some new circuit codes
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)
