On the Kronecker Product Construction of Completely Transitive q-Ary Codes
From MaRDI portal
(Redirected from Publication:3540933)
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
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3463505 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Completely regular codes
- Completely regular codes and completely transitive codes
- Completely transitive codes in Hamming graphs
- Construction of new completely regular q-ary codes from perfect q-ary codes
- On new completely regular q-ary codes
- On non-antipodal binary completely regular 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)
