Completely regular codes by concatenating Hamming codes
From MaRDI portal
Publication:1783729
DOI10.3934/AMC.2018021zbMATH Open1414.94943arXiv1703.05929OpenAlexW2602780485WikidataQ130034718 ScholiaQ130034718MaRDI QIDQ1783729FDOQ1783729
Authors: J. Borges, Josep Rifà, Victor A. Zinoviev 
Publication date: 21 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.
Full work available at URL: https://arxiv.org/abs/1703.05929
Recommendations
Cites Work
- Title not available (Why is that?)
- Completely regular codes
- The Geometry of Two-Weight Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completely transitive codes in Hamming graphs
- Distance-regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completely regular codes and completely transitive codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On new completely regular \(q\)-ary codes
- Title not available (Why is that?)
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- Title not available (Why is that?)
- On complete regularity of extended codes
- Generalized t-designs and majority decoding of linear codes
- All nearly perfect codes are known
Cited In (9)
- A note on completely regular codes
- On completely regular codes
- About non equivalent completely regular codes with identical intersection array
- On new completely regular \(q\)-ary codes
- Completely regular codes and completely transitive codes
- A new distance-regular graph of diameter 3 on 1024 vertices
- On new infinite families of completely regular and completely transitive codes
- Uniqueness of certain completely regular Hadamard codes
- On completely regular and completely transitive supplementary codes
This page was built for publication: Completely regular codes by concatenating Hamming codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783729)
