The Grey-Rankin bound for nonbinary codes

DOI10.1134/S0032946006030033zbMath1237.94148MaRDI QIDQ415670

L. A. Bassalygo, Tor Helleseth, Stefan Dodunekov, Victor A. Zinoviev

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (7)

On two-weight codes ⋮ Product Construction of Affine Codes ⋮ On the classification of completely regular codes with covering radius two and antipodal duals ⋮ On codes with distances \(d\) and \(n\) ⋮ New nonbinary code bounds based on divisibility arguments ⋮ Special sequences as subcodes of Reed-Solomon codes ⋮ Optimal almost equisymbol codes based on difference matrices

Cites Work

• Unnamed Item
• Correction to 'Some Bounds for Error-Correcting Codes'
• On the Hamming distance between two i.i.d. random n-tuples over a finite set

This page was built for publication: The Grey-Rankin bound for nonbinary codes