Theory of Unidirectional Error Correcting/Detecting Codes

Bose,; Rao, Shilpa

doi:10.1109/tc.1982.1676034

Cited by 118 publications

(36 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Ei usc 0 and columns of parity-check matrix for [5,1,5] code. 1 , 2, 4, 7, 15,26, 45, 54, 66, 83} in Z��.…”

Section: (36)mentioning

confidence: 99%

“…Similarly . /; is obtained from the words of ,9' that have 1 's in coordinates (0,1), (0, 2), . .. , (0,6); ./3 from (1, 2), (1, 3),' . "…”

Section: Constant Weight Codes From Translates Of Linear Codesmentioning

confidence: 99%

“…Op timal and maximal partitions: We first show that the partitions marked with an asterisk in Table VI We must show that (4,4,4,4,4) and (4,4,4,4,3,1) are impossible. Since C, has column sums 2, the last four vectors of the partition also have column sums 2, and are therefore equivalent either to C1 or to…”

mentioning

confidence: 99%

“…Also (7, 7, 6,6,6, 66.66,60,6054.45.44.40,26. 1 A 66.66.60.60.54.45.44.42,22,3 (3) * 20.20,20.20.20,20.20.20,20.20 impossible, for it would shorten to either 7T(6, 3) = (4,4,4,4,4) or (4,4,4,4,3,1). (Any class of size 6 must shorten in three ways to a class of size 4 and in four ways to a class of size 3.)…”

mentioning

confidence: 99%

See 3 more Smart Citations

A new table of constant weight codes

Brouwer

Shearer

Sloane

et al. 1990

IEEE Trans. Inform. Theory

359

276

View full text Add to dashboard Cite

Abstract-A table of binary constant weight codes of length n <; 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length J1 <; 28. I. I'ITRODUCTIONT HE MAIN GOAL of this paper is to givc an exten sive table of lower bounds on A(n, d, w), the maximal possible number of binary vectors of length n, Hamming distance at least d apart, and constant weight w. We also give a table of lower bounds on A(n, d), the maximal possible number of binary vectors of length n and Ham ming distance at least d apart (with no restriction on weight).These functions have been studied by many authors, and were tabulated for n:<:: 24 in [13], [45], [72], [132]. In the present paper we extend the tables to length n:<:: 28.Our main concern is with Table I, the table of constant weight codes. The majority of the 600 codes in this table are new, either because we have discovered nicer versions of existing codes, or (more frequcntly) because we have found better codes than were known before.Our goal has been to give either an explicit construc tion or a reference for every code in the table. With some exceptions a rcadcr should be able to reconstruct any of these codes from the information given here. (This is in contrast to [13], where several codes are simply describcd as being found by an unstatcd "miscellaneous construc tion".) However, because of space limitations, we have not included explicit listings for the codes constructed in Section XII (indicated by "y" in Table 1) when they contain more than 1500 codewords.Although [13] gives both upper and lower bounds on A(n, d, w) and A(n, d), in the present paper we give only lower bounds, i.e. tables of actual codes. We have not To save space we have sometimes written vectors in hexa decimal, using 0 = 0000,' . " 9 = 1001, A = 1010, . . " F = 1111, usually omitting leading zeros (so the vectors are right-justified). Superscripts (for example in Table XV) indicate the number of vectors in an orbit. Parenthe scs inside a vector (for example in Tables XII-XIV) indicate that all simultaneous cyclic shifts of the paren thesized sections are to be used. For example (110)(10) is an abbreviation for the six vectors 11010,01101,10110, 11001,01110,10101.A design (X, . 9]) is a set X (of "points") together with a collection [f8 of subscts of X (called "blocks"). A t -(V,k,A) design is a design in which IXI = v, all blocks contain exactly k points, and any t distinct points of X More generally an (r, A)-design is a design in which cach point belongs to exactly r blocks and each pair of points belong to exactly A blocks (but the blocks need not all contain the same number of points). A symmetric design

show abstract

“…In Ei usc 0 and columns of parity-check matrix for [5,1,5] code. 1 , 2, 4, 7, 15,26, 45, 54, 66, 83} in Z��.…”

Section: (36)mentioning

confidence: 99%

“…Similarly . /; is obtained from the words of ,9' that have 1 's in coordinates (0,1), (0, 2), . .. , (0,6); ./3 from (1, 2), (1, 3),' . "…”

Section: Constant Weight Codes From Translates Of Linear Codesmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A new table of constant weight codes

Brouwer

Shearer

Sloane

et al. 1990

IEEE Trans. Inform. Theory

359

276

View full text Add to dashboard Cite

show abstract

“…Section 3) and to all unidirectional error-detecting (AUED) codes (Bose and Rao 1982. Theorem 5). All DI codes that we present were already known as AUED codes.…”

Section: Requirements For Delay-insensitive Codesmentioning

confidence: 99%

Delay-insensitive codes — an overview

1988

View full text Add to dashboard Cite

A method to construct constant weight t‐error correcting codes

Matsumoto

Imai

Saitoh

et al. 1990

Electron Comm Jpn Pt III

View full text Add to dashboard Cite

This paper proposes a construction method for constant weight t‐error‐correcting codes. These codes are nonsystematic t‐error‐correcting and all‐unidirectional‐error‐detecting (t‐EC/AUED) codes. The format of these codes is given by generalization of the Bose‐Rao code and the Kundu‐Reddy code, and a codeword of these codes is the concatenation of constant weight codes. Concrete methods to construct 3‐ and 4‐EC/AUED codes also are given. For example, 3‐EC/AUED codes of length 80 proposed so far have at most 246 codewords, whereas the proposed method gives a code having 251 codewords when Bose's method for encoding binary information words into constant weight words is used.

show abstract

Theory of Unidirectional Error Correcting/Detecting Codes

Cited by 118 publications

References 15 publications

A new table of constant weight codes

A new table of constant weight codes

Delay-insensitive codes — an overview

A method to construct constant weight t‐error correcting codes

Contact Info

Product

Resources

About