On constacyclic codes over finite fields

DOI10.1007/S12095-015-0163-4zbMATH Open1344.94097OpenAlexW2268838648MaRDI QIDQ301647FDOQ301647

Authors: Anuradha Sharma, Saroj Rani 

Publication date: 1 July 2016

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0163-4

Recommendations

• Constacyclic codes over finite fields
• A class of constacyclic codes over a finite field. II
• A class of constacyclic codes over a finite field
• Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
• Structure of repeated-root constacyclic codes of length \(8 \ell^m p^n\)

zbMATH Keywords

cyclic codescyclotomic cosetsnegacyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Cites Work

• Title not available (Why is that?)
• Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
• Polyadic codes of prime power length
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• Algebraic coding theory
• Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Repeated-root constacyclic codes of length
• Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
• On repeated-root constacyclic codes of length \(4p^s\)
• Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
• Constacyclic codes over finite fields
• A class of constacyclic codes over a finite field
• \(\lambda\)-mapping and primitive idempotents in semisimple ring \(\mathfrak R_m\)
• Simple-root negacyclic codes of length \(2p^n{\ell}^m\) over a finite field
• Some constacyclic codes over finite chain rings
• On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings

Cited In (30)

• Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
• Two dimensional constacyclic codes of arbitrary length over finite fields
• Optimal binary constant weight codes and affine linear groups over finite fields
• A note on constabelian codes
• Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
• Repeated-root constacyclic codes of length \(n l p^s\)
• A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
• Galois self-orthogonal constacyclic codes over finite fields
• Constacyclic codes over finite fields
• \(\lambda\)-constacyclic codes over finite Krasner hyperfields
• A class of constacyclic codes over a finite field
• On some classes of constacyclic codes over polynomial residue rings
• A class of constacyclic codes over a finite field. II
• Several families of irreducible constacyclic and cyclic codes
• A \(q\)-polynomial approach to constacyclic codes
• Equivalence classes and structures of constacyclic codes over finite fields
• Title not available (Why is that?)
• A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u]/\langle u^2\rangle\)
• Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
• The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
• Constacyclic codes as invariant subspaces
• The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
• Properties of constacyclic codes under the Schur product
• Galois hulls of constacyclic codes over finite fields
• Title not available (Why is that?)
• MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
• Constacyclic codes over \(R_k\)
• Structure of repeated-root constacyclic codes of length \(8 \ell^m p^n\)
• The Galois variance of constacyclic codes
• A class of constacyclic codes from group algebras

This page was built for publication: On constacyclic codes over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301647)