A NEW EXPLANATION OF THE REFLECTED BINARY CODE.OBERMAN RMM.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 6; PP. 641-642; BIBL. 3 REF.Article

Two new binary codes with minimum distance threeHAMALAINEN, H.IEEE transactions on information theory. 1988, Vol 34, Num 4, issn 0018-9448, 875Article

An extension of an inequality by ahlswede, El Gamal and Pang for pairs of binary codesDELSARTE, P; PIRET, P.Discrete mathematics. 1985, Vol 55, Num 3, pp 313-315, issn 0012-365XArticle

Codes and length-increasing transitive binary relationsDO LONG VAN; KIEU VAN HUNG; PHAN TRUNG HUY et al.Lecture notes in computer science. 2005, pp 29-48, issn 0302-9743, isbn 3-540-29107-5, 1Vol, 20 p.Conference Paper

Two's complement extension of a parallel binary division by tenPETRY, F. E.Electronics Letters. 1983, Vol 19, Num 18, pp 718-720, issn 0013-5194Article

SIGNED MODIFIED REFLECTED BINARY CODE.AGRAWAL DP.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 5; PP. 549-552; BIBL. 6 REF.Article

On vectors of weight 16 in the code of a projective plane of order 10PRINCE, A. R.Proceedings of the Royal Society of Edinburgh. Section A. Mathematics. 1983, Vol 95, Num 1-2, pp 137-146, issn 0308-2105Article

Coding scheme for a wire-tap channel using regular codesHUGUET, L.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 191-201, issn 0012-365XArticle

On Non-binary quantum BCH codesZHI MA; XIN LU; KEQIN FENG et al.Lecture notes in computer science. 2006, pp 675-683, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 9 p.Conference Paper

The equivalence of certain equidistant binary codes and symmetric bibdsSTINSON, D. R; VAN REES, G. H. J.Combinatorica (Print). 1984, Vol 4, Num 4, pp 357-362, issn 0209-9683Article

On a lower bound on the number of perfect binary codesMALYUGIN, S. A.Discrete applied mathematics. 2004, Vol 135, Num 1-3, pp 157-160, issn 0166-218X, 4 p.Article

NOTIONS THEORIQUES UTILISEES EN CONVERSION. CODES - OPERATION DE MAINTIEN.LORIFERNE B.1975; MESURE REGUL. AUTOMAT.; FR.; DA. 1975; VOL. 40; NO 10; PP. 41-47; BIBL. 16 REF.Article

Information Sets From Defining Sets in Abelian CodesJOAQUIN BERNAL, José; JACOBO SIMON, Juan.IEEE transactions on information theory. 2011, Vol 57, Num 12, pp 7990-7999, issn 0018-9448, 10 p.Article

Practical construction of binary codes and its decodingHUBER, K.AEU. Archiv für Elektronik und Übertragungstechnik. 1991, Vol 45, Num 1, pp 55-57, issn 0001-1096, 3 p.Article

Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6WEBER, J. H; DE VROEDT, C; BOEKEE, D. E et al.IEEE transactions on information theory. 1988, Vol 34, Num 5, pp 1321-1331, issn 0018-9448Article

A note on perfect arithmetic codesASTOLA, J.IEEE transactions on information theory. 1986, Vol 32, Num 3, pp 443-445, issn 0018-9448Article

New Constant-Weight Codes From Propagation RulesYEOW MENG CHEE; CHAOPING XING; SZE LING YEO et al.IEEE transactions on information theory. 2010, Vol 56, Num 4, pp 1596-1599, issn 0018-9448, 4 p.Article

Dynamic mixed huffman codesULACHA, Grzegorz; STASINSKI, Ryszard.International conference on signals and electronic systems. 2005, pp 537-540, isbn 83-906074-7-6, 1Vol, 4 p.Conference Paper

The minimal covering radius t[15,6] of a six-dimensional binary linear code of length 15 is equal to 4SIMONIS, J.IEEE transactions on information theory. 1988, Vol 34, Num 5, pp 1344-1345, issn 0018-9448Article

Une nouvelle famille de 3-codes parfaits sur GF(q) = A new family of perfect 3-codes on GF(q)MOLLARD, M.Discrete mathematics. 1984, Vol 49, Num 2, pp 209-212, issn 0012-365XArticle

Binary sequence with a high crosscorrelation with each member of a subset of gold codesYATES, K. W; BEACH, M. A; COPPING, A. J et al.Electronics Letters. 1986, Vol 22, Num 18, pp 930-932, issn 0013-5194Article

On certain projective geometry codesHUANG, J. F; SHIVA, S. G. S; SEGUIN, G et al.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 385-388, issn 0018-9448Article

The complexity of computing the coverning radius of a codeLOUGHLIN, A. M. M.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 800-804, issn 0018-9448Article

Efficient exhaustive search for optimal-peak-sidelobe binary codesCOXSON, Greg; RUSSO, Jon.IEEE Radar Conference. 2004, pp 438-443, isbn 0-7803-8234-X, 6 p.Conference Paper

On minimal decoding sets for the extended binary golay codeANDERSON, J. L.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1560-1561, issn 0018-9448Article