The Grey-Rankin bound for nonbinary codes

DOI10.1134/S0032946006030033MaRDI QIDQ415670zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3438734 (Why is no real title available?)
• Correction to 'Some Bounds for Error-Correcting Codes'
• On the Hamming distance between two i.i.d. random n-tuples over a finite set

Cited in

(10)

• Optimal almost equisymbol codes based on difference matrices
• Special sequences as subcodes of Reed-Solomon codes
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• On codes with distances \(d\) and \(n\)
• scientific article; zbMATH DE number 4059291 (Why is no real title available?)
• Generalized Gray map and a class of \(p\)-ary nonlinear codes
• Product construction of affine codes
• On two-weight codes
• On the classification of completely regular codes with covering radius two and antipodal duals
• New nonbinary code bounds based on divisibility arguments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415670)