Optimal quinary negacyclic codes with minimum distance four
From MaRDI portal
Publication:6163791
DOI10.3934/amc.2021043OpenAlexW3202484856MaRDI QIDQ6163791
Publication date: 30 June 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2021043
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Equations in general fields (12E12) Cyclic codes (94B15)
Cites Work
- Optimal \(p\)-ary cyclic codes with minimum distance four from monomials
- A class of binary cyclic codes with generalized Niho exponents
- Optimal ternary cyclic codes with minimum distance four and five
- The weight distribution of a class of \(p\)-ary cyclic codes
- Two families of Niho sequences having four-valued cross correlation with \(m\)-sequences
- A class of optimal ternary cyclic codes and their duals
- On the minimum distance of negacyclic codes with two zeros
- A coding theory construction of new systematic authentication codes
- Constructions of new nonbinary quantum codes
- Linear Codes From Some 2-Designs
- Application of Constacyclic Codes to Quantum MDS Codes
- The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
- New Quantum MDS Codes From Negacyclic Codes
- Pseudocyclic maximum-distance-separable codes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Fundamentals of Error-Correcting Codes
- Constacyclic codes, cocycles and a u+v|u-v construction
- Algebraic Coding Theory
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Optimal Ternary Cyclic Codes From Monomials
- On decoding BCH codes
This page was built for publication: Optimal quinary negacyclic codes with minimum distance four
