Two new upper bounds for codes of distance 3

Simon Litsyn; Alexander Vardy

doi:10.1007/3-540-57843-9_26

Two new upper bounds for codes of distance 3

Simon Litsyn, Alexander Vardy

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that .4(10, 3) = A(11, 4) ≤ 78 and A(11, 3) = A(12, 4) ≤ 156.

Original language	English
Title of host publication	Algebraic Coding - 1st French-Israeli Workshop, Proceedings
Editors	Gerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
Publisher	Springer Verlag
Pages	253-262
Number of pages	10
ISBN (Print)	9783540578437
DOIs	https://doi.org/10.1007/3-540-57843-9_26
State	Published - 1994
Event	1st French-Israeli Workshop on Algebraic Coding, 1993 - Paris, France Duration: 19 Jul 1993 → 21 Jul 1993

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	781 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st French-Israeli Workshop on Algebraic Coding, 1993
Country/Territory	France
City	Paris
Period	19/07/93 → 21/07/93

Access to Document

10.1007/3-540-57843-9_26

Cite this

Litsyn, S., & Vardy, A. (1994). Two new upper bounds for codes of distance 3. In G. Cohen, A. Lobstein, G. Zemor, & S. Litsyn (Eds.), Algebraic Coding - 1st French-Israeli Workshop, Proceedings (pp. 253-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 781 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-57843-9_26

Litsyn, Simon ; Vardy, Alexander. / Two new upper bounds for codes of distance 3. Algebraic Coding - 1st French-Israeli Workshop, Proceedings. editor / Gerard Cohen ; Antoine Lobstein ; Gilles Zemor ; Simon Litsyn. Springer Verlag, 1994. pp. 253-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b3ba617598f1403492dea1a88d71ecfa,

title = "Two new upper bounds for codes of distance 3",

abstract = "We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that .4(10, 3) = A(11, 4) ≤ 78 and A(11, 3) = A(12, 4) ≤ 156.",

author = "Simon Litsyn and Alexander Vardy",

year = "1994",

doi = "10.1007/3-540-57843-9_26",

language = "אנגלית",

isbn = "9783540578437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "253--262",

editor = "Gerard Cohen and Antoine Lobstein and Gilles Zemor and Simon Litsyn",

booktitle = "Algebraic Coding - 1st French-Israeli Workshop, Proceedings",

}

Litsyn, S & Vardy, A 1994, Two new upper bounds for codes of distance 3. in G Cohen, A Lobstein, G Zemor & S Litsyn (eds), Algebraic Coding - 1st French-Israeli Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 781 LNCS, Springer Verlag, pp. 253-262, 1st French-Israeli Workshop on Algebraic Coding, 1993, Paris, France, 19/07/93. https://doi.org/10.1007/3-540-57843-9_26

Two new upper bounds for codes of distance 3. / Litsyn, Simon; Vardy, Alexander.

Algebraic Coding - 1st French-Israeli Workshop, Proceedings. ed. / Gerard Cohen; Antoine Lobstein; Gilles Zemor; Simon Litsyn. Springer Verlag, 1994. p. 253-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 781 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Two new upper bounds for codes of distance 3

AU - Litsyn, Simon

AU - Vardy, Alexander

PY - 1994

Y1 - 1994

N2 - We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that .4(10, 3) = A(11, 4) ≤ 78 and A(11, 3) = A(12, 4) ≤ 156.

AB - We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that .4(10, 3) = A(11, 4) ≤ 78 and A(11, 3) = A(12, 4) ≤ 156.

UR - http://www.scopus.com/inward/record.url?scp=85026888805&partnerID=8YFLogxK

U2 - 10.1007/3-540-57843-9_26

DO - 10.1007/3-540-57843-9_26

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85026888805

SN - 9783540578437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 253

EP - 262

BT - Algebraic Coding - 1st French-Israeli Workshop, Proceedings

A2 - Cohen, Gerard

A2 - Lobstein, Antoine

A2 - Zemor, Gilles

A2 - Litsyn, Simon

PB - Springer Verlag

Y2 - 19 July 1993 through 21 July 1993

ER -

Litsyn S, Vardy A. Two new upper bounds for codes of distance 3. In Cohen G, Lobstein A, Zemor G, Litsyn S, editors, Algebraic Coding - 1st French-Israeli Workshop, Proceedings. Springer Verlag. 1994. p. 253-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-57843-9_26

Two new upper bounds for codes of distance 3

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this