A note on upper bounds for minimum distance codes

DOI10.1016/S0019-9958(58)80006-6zbMath0086.33404MaRDI QIDQ3259316

Devi Datt Joshi

Publication date: 1958

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

probability theory

Related Items (max. 100)

Slight improvements of the Singleton bound ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ Optimal codes, n-arcs and Laguerre geometry ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)

This page was built for publication: A note on upper bounds for minimum distance codes