TY - GEN
T1 - On upper bounds for the distance of codes of small size
AU - Krasikov, Ilia
AU - Litsyn, Simon
PY - 1997
Y1 - 1997
N2 - Combining a linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d=(n-j)/2, 01/3. For j=o(n 1/3) these bounds practically coincide with the Tietavainen bound (1980) and are slightly better. For fixed j and j proportional to n 1/3, j1/3-(2/9)ln n, it improves on the earlier known results.
AB - Combining a linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d=(n-j)/2, 01/3. For j=o(n 1/3) these bounds practically coincide with the Tietavainen bound (1980) and are slightly better. For fixed j and j proportional to n 1/3, j1/3-(2/9)ln n, it improves on the earlier known results.
UR - http://www.scopus.com/inward/record.url?scp=0030702404&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1997.612999
DO - 10.1109/ISIT.1997.612999
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0030702404
SN - 0780339568
SN - 9780780339569
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 84
BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Y2 - 29 June 1997 through 4 July 1997
ER -