On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
From MaRDI portal
Publication:2682398
DOI10.1007/s00200-020-00472-6OpenAlexW3124439458MaRDI QIDQ2682398
Paravee Maneejuk, Narendra Kumar, Indivar Gupta, Manoj Kumar Singh, Abhay Kumar Singh, Hai Quang Dinh
Publication date: 31 January 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00472-6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Maximum distance separable codes for \(b\)-symbol read channels
- Modular and \(p\)-adic cyclic codes
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- A Construction of New MDS Symbol-Pair Codes
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Fundamentals of Error-Correcting Codes
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Weight distributions of cyclic self-dual codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
