Semisimple cyclic and Abelian codes. II
From MaRDI portal
Publication:4229323
DOI10.1007/BF01119999zbMath1026.94551MaRDI QIDQ4229323
Publication date: 9 March 1999
Published in: Cybernetics (Search for Journal in Brave)
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclic codes (94B15)
Related Items (49)
Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)] ⋮ A characterization of abelian group codes in terms of their parameters ⋮ Recent progress on weight distributions of cyclic codes over finite fields ⋮ EXPLICIT DETERMINATION OF CERTAIN MINIMAL ABELIAN CODES AND THEIR MINIMUM DISTANCES ⋮ Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\) ⋮ Repeated-root constacyclic codes of prime power lengths over finite chain rings ⋮ On structure and distances of some classes of repeated-root constacyclic codes over Galois rings ⋮ Minimal ideals in finite abelian group algebras and coding theory ⋮ Group algebras and coding theory ⋮ Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\) ⋮ Algebraic theory of block codes detecting independent errors ⋮ Unnamed Item ⋮ Some new constructions of isodual and LCD codes over finite fields ⋮ Some minimal cyclic codes over finite fields ⋮ On the number of non-G-equivalent minimal abelian codes ⋮ On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ Repeated-root constacyclic codes of length \(\ell p^s\) and their duals ⋮ Essential idempotents and codes of constant weight ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Duadic codes over \(\mathbb{Z}_4+u\mathbb{Z}_4 \) ⋮ Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ Repeated-root constacyclic codes of length $2p^s$ over Galois rings ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ On idempotents of a class of commutative rings ⋮ Symbol-triple distance of repeated-root constacyclic codes of prime power lengths ⋮ Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ Repeated-root constacyclic codes of length ⋮ Unnamed Item ⋮ Idempotents in group algebras and minimal abelian codes ⋮ Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \) ⋮ Symmetric LDPC codes and local testing ⋮ Explicit determination of certain minimal constabelian codes ⋮ Semisimple finite group algebra of a generalized strongly monomial group ⋮ Repeated-root constacyclic codes of length \(2 \ell^m p^n\) ⋮ One-weight codes in some classes of group rings ⋮ Unnamed Item ⋮ On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) ⋮ Minimal codes of prime-power length. ⋮ Essential idempotents in group algebras and coding theory ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Linear codes with given automorphism groups ⋮ Minimal cyclic codes of length \(2p^n\) ⋮ Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)] ⋮ Explicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pm ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Construction of optimal codes from a class of constacyclic codes ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
This page was built for publication: Semisimple cyclic and Abelian codes. II
