Explicit determination of certain minimal abelian codes and their minimum distances
From MaRDI portal
Recommendations
Cites work
- Classical codes as ideals in group algebras
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- Idempotents in group algebras and minimal abelian codes
- Jacobi sums over finite fields
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- Minimal cyclic codes of length \(p^{n} q\).
- Properties that characterize Gaussian periods and cyclotomic numbers
- Semisimple cyclic and Abelian codes. II
- The primitive idempotents of a cyclic group algebra.
- Weights of abelian codes
Cited in
(10)- On minimum distance bounds for abelian codes
- On equivalent classes of minimal abelian codes
- Construction of minimal non-abelian left group codes
- Minimal ideals in finite abelian group algebras and coding theory
- scientific article; zbMATH DE number 812084 (Why is no real title available?)
- Primitive idempotents in group algebras and minimal abelian codes
- A characterization of abelian group codes in terms of their parameters
- On the number of non-\(G\)-equivalent minimal abelian codes
- scientific article; zbMATH DE number 7124313 (Why is no real title available?)
- Explicit determination of certain minimal constabelian codes
This page was built for publication: Explicit determination of certain minimal abelian codes and their minimum distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911871)
