scientific article; zbMATH DE number 5589270
From MaRDI portal
Publication:5324241
zbMATH Open1181.94119MaRDI QIDQ5324241FDOQ5324241
Publication date: 3 August 2009
Title of this publication is not available (Why is that?)
Hamming distancecyclic codeschain ringsconstacyclic codesdual codesnegacyclic codesrepeated-root codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cited In (12)
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Explicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pm
- On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
- Title not available (Why is that?)
- Repeated-root constacyclic codes of length
- DNA cyclic codes over the ring 𝔽2[u,v]/〈u2 − 1,v3 − v,uv − vu〉
- Repeated-root constacyclic codes of length \(n l p^s\)
- Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\)
- Construction of optimal codes from a class of constacyclic codes
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- On Repeated-Single-Root Constacyclic Codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5324241)
