Two new upper bounds for codes of distance 3

Simon Litsyn, Alexander Vardy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAlgebraic Coding - 1st French-Israeli Workshop, Proceedings
EditorsGerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
PublisherSpringer Verlag
Pages253-262
Number of pages10
ISBN (Print)9783540578437
DOIs
StatePublished - 1994
Event1st French-Israeli Workshop on Algebraic Coding, 1993 - Paris, France
Duration: 19 Jul 199321 Jul 1993

Publication series

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

Conference

Conference1st French-Israeli Workshop on Algebraic Coding, 1993
Country/TerritoryFrance
CityParis
Period19/07/9321/07/93

Fingerprint

Dive into the research topics of 'Two new upper bounds for codes of distance 3'. Together they form a unique fingerprint.

Cite this