Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
From MaRDI portal
Publication:5133858
DOI10.1142/S0219498820502096zbMath1480.94042OpenAlexW2978231130WikidataQ114614535 ScholiaQ114614535MaRDI QIDQ5133858
Sampurna Satpati, Abhay Kumar Singh, Woraphon Yamaka, Hai Quang Dinh
Publication date: 11 November 2020
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498820502096
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Cyclic codes (94B15)
Related Items (3)
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 and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) ⋮ Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of prime power lengths over finite chain 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
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- 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
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- Fundamentals of Error-Correcting Codes
- On the Structure of Cyclic and Negacyclic Codes over Finite Chain Rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Semisimple cyclic and Abelian codes. II
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Weight distributions of cyclic self-dual codes
- 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: Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
