On the Kronecker Product Construction of Completely Transitive q-Ary Codes
From MaRDI portal
Publication:3540933
DOI10.1007/978-3-540-87448-5_17zbMATH Open1166.94354OpenAlexW1492792328MaRDI QIDQ3540933FDOQ3540933
Authors: Josep Rifà, Victor A. Zinoviev 
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87448-5_17
Recommendations
- New Completely Regular $q$-ary Codes Based on Kronecker Products
- Construction of new completely regular \(q\)-ary codes from perfect \(q\)-ary codes
- On the construction of \(q\)-ary equidistant codes
- Constructions for $q$-Ary Constant-Weight Codes
- On the construction of transitive codes
- On new completely regular \(q\)-ary codes
- A product construction for perfect codes over arbitrary alphabets (Corresp.)
- On the structure of non-full-rank perfect \(q\)-ary codes
- New constructions for \(q\)-ary covering codes
- Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
Cites Work
- Title not available (Why is that?)
- Completely regular 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
- Completely regular codes and completely transitive codes
- On non-antipodal binary completely regular codes
- On new completely regular \(q\)-ary codes
- Title not available (Why is that?)
- Construction of new completely regular \(q\)-ary codes from perfect \(q\)-ary codes
Cited In (2)
This page was built for publication: On the Kronecker Product Construction of Completely Transitive q-Ary Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540933)
