A new class of nonbinary codes meeting the Griesmer bound
From MaRDI portal
Publication:1314334
DOI10.1016/0166-218X(93)90127-AzbMath0786.94016OpenAlexW2141672126MaRDI QIDQ1314334
Tor Helleseth, Øyvind Ytrehus, Noboru Hamada
Publication date: 22 February 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90127-a
Related Items (9)
Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ Uniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes] ⋮ A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3\)-codes with \(B_ 2=0\)] ⋮ Asymmetric quantum Griesmer codes detecting a single bit-flip error ⋮ Three new constructions of optimal linear codes with few weights ⋮ Anticode-based locally repairable codes with high availability ⋮ The smallest length of binary 7-dimensional linear codes with prescribed minimum distance ⋮ Projective codes meeting the Griesmer bound ⋮ A family of linear codes from constant dimension subspace codes
Cites Work
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- New constructions of codes meeting the Griesmer bound
- A new class of codes meeting the Griesmer bound
- A characterization of codes meeting the Griesmer bound
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- Unnamed Item
This page was built for publication: A new class of nonbinary codes meeting the Griesmer bound
