GENERALIZED INACCURACY AND A CODING THEOREM.RAM AUTAR; SONI RS.1976; PROC. INDIAN ACAD. SCI., A; INDIA; DA. 1976; VOL. 84; NO 5; PP. 204-209; BIBL. 12 REF.Article

UEBER DIE MAXIMALE BLOCKLAENGE OPTIMALER CODES = SUR LA LONGUEUR BLOC MAXIMALE DE CODES OPTIMAUXHEISE W.1979; SER. INTERNATION. ANAL. NUMER.; CHE; DA. 1979; VOL. 46; PP. 128-134; BIBL. 6 REF.Conference Paper

UNE APPLICATION DE LA THEORIE DES CODES AUX GROUPES DE RANG 3 IMPRIMITIFS DONT LES BLOCS SONT DE LONGUEUR 2.LEFEVRE C.1974; BULL. SOC. MATH. BELG.; BELG.; DA. 1974; VOL. 26; NO 1; PP. 48-80; BIBL. 9 REF.Article

SELECTION DU NOMBRE DE BITS POUR LA TRANSMISSION DE L'INFORMATION RELATIVE AUX CARACTERISTIQUES ALEATOIRES D'UN PROCESSUSGLADKIJ VS.1973; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1973; NO 3; PP. 159-166; ABS. ANGL.; BIBL. 4 REF.Serial Issue

SUR LA DENSITE DE L'EMPILEMENT DES SPHERES DE RAYON 1 DANS L'ESPACE DE HAMMINGKATSMAN GL.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 2; PP. 52-56; BIBL. 6 REF.Article

SUR LES BORNES POUR LE NOMBRE DE MOTS DE CODE DANS LES CODES ARITHMETIQUES BINAIRESKABATYANSKIJ GA.1976; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1976; VOL. 12; NO 4; PP. 46-54; BIBL. 15 REF.Article

DETERMINATION OF ALL ADDITIVE QUASIARITHMETIC MEAN CODEWORD LENGTHS.ACZEL J.1974; Z. WAHRSCHEIN.-THEOR. VERWANDTE GEB.; DTSCH.; DA. 1974; VOL. 29; NO 4; PP. 351-360; BIBL. 6 REF.Article

EFFECTIVE CONSTRAINT LENGTH OF "CYCLIC" CONVOLUTIONAL SELF ORTHOGONAL CODESMCQUILTON D.1981; IEE PROC., PART E; ISSN 0143-7062; GBR; DA. 1981; VOL. 128; NO 2; PP. 69-73; BIBL. 8 REF.Article

DIFFERENCE ET RESSEMBLANCE ENTRE LE RETARD ET LA PROFONDEURKHRAPCHENKO VM.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 35; PP. 141-168; BIBL. 2 REF.Article

BOUNDS FOR BINARY CODES OF LENGTH LESS THAN 25BEST MR; BROUWER AE; MACWILLIAMS FJ et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 1; PP. 81-92; BIBL. 66 REF.Article

A NEW APPROACH TO ERROR-CORRECTING CODES.LEMPEL A; WINOGRAD S.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 503-508; BIBL. 9 REF.Article

A CORRESPONDENCE ON STRONGLY PREFIX CODES.LASSEZ JL.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 3; PP. 344-345; BIBL. 5 REF.Article

MULTIPHASE COMPLEMENTARY CODES = CODES COMPLEMENTAIRES A PHASES MULTIPLESSIVASWAMY R.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 5; PP. 546-552; BIBL. 18 REF.Article

SUR LA PROFONDEUR DES FONCTIONS BOOLEENNESGASHKOV SB.1978; PROBL. KIBERN.; SUN; DA. 1978; NO 34; PP. 265-268; BIBL. 5 REF.Article

SOME RESULTS ON THE PROBLEM OF CONSTRUCTING ASYMPTOTICALLY GOOD ERROR-CORRECTING CODES.WELDON EJ JR.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 4; PP. 412-417; BIBL. 13 REF.Article

SOME RESULTS ON ARITHMETIC CODES OF COMPOSITE LENGTHHWANG TY; HARTMAN CRP.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 1; PP. 93-99; BIBL. 14 REF.Article

On the maximum length of Huffman codesBURO, M.Information processing letters. 1993, Vol 45, Num 5, pp 219-223, issn 0020-0190Article

Constacyclic codes and cocyclesHUGHES, G.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 233Conference Paper

On the reconstruction of perfect codesHEDEN, Olof.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 479-485, issn 0012-365XArticle

Multidimensional extension of Reed-Solomon codesSHEN, B.-Z; TZENG, K. K.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 54Conference Paper

Split weight enumerators of extremal self-dual codesFIELDS, J; PLESS, V.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 466Conference Paper

Asymptotically optimal lossy Lempel-Ziv codingKONTOYIANNIS, I.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 273Conference Paper

Efficient decoding of Reed-Solomon codes beyond half the minimum distanceROTH, R. M; RUCKENSTEIN, G.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 56Conference Paper

Type for hierarchical probability model class and universal codingMATSUSHIMA, T; HIRASAWA, S.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 319Conference Paper

Optimal coding of infinite streams of dataATTESON, K.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 348Conference Paper