SHORT UNIT-MEMORY BYTE-ORIENTED BINARY CONVOLUTIONAL CODES HAVING MAXIMAL FREE DISTANCE.LIN NAN LEE.1976; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 3; PP. 349-352; BIBL. 10 REF.Article

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

AN ANALYSIS OF SEQUENTIAL DECODING FOR SPECIFIC TIME-INVARIANT CONVOLUTIONAL CODES = ANALYSE DU DECODAGE SEQUENTIEL POUR DES CODES DE CONVOLUTION, INVARIANT DANS LE TEMPS, SPECIFIQUESCHEVILLAT PR; COSTELLO DJ JR.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 4; PP. 443-451; BIBL. 23 REF.Article

CONVOLUTIONS PONDEREES DE QUELQUES CLASSES DE CODES CYCLIQUES SUR GF (Q)TAIRYAN VI.1978; PROBL. PEREDACHI INFORM.; SUN; DA. 1978; VOL. 14; NO 3; PP. 35-39; BIBL. 7 REF.Article

CONCATENATED CODES WITH LARGE MINIMUM DISTANCE.LIH JYH WENG.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 5; PP. 613-615; BIBL. 7 REF.Article

EQUIDISTANT CODES WITH DISTANCE 12.HALL JI; JANSEN AJEM; KOLEN AWJ et al.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 1; PP. 71-83Article

HIGH RATE CONVOLUTIONAL CODES WITH GOOD DISTANCE PROFILES.HAGENAUER J.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 5; PP. 615-618; BIBL. 9 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

AN ASYMPTOTIC HAMMING BOUND ON THE FEEDBACK DECODING MINIMUM DISTANCE OF LINEAR TREE CODES.AALTONEN MJ.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 3; PP. 396-397; BIBL. 6 REF.Article

SUR UNE BORNE GENERALE POUR LE VOLUME D'UN CODEGABIDULIN EH M; SIDORENKO VR.1976; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1976; VOL. 12; NO 4; PP. 31-35; BIBL. 5 REF.Article

(L,G)-CODES CYCLIQUESSHEKHUNOVA NA; MIRONCHIKOV ET.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 2; PP. 3-9; BIBL. 5 REF.Article

SPECTRES PONDERES DE QUELQUES CLASSES DE CODES CYCLIQUES BINAIRESTAIRYAN VI.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 2; PP. 78-84; BIBL. 9 REF.Article

CODES EN DAMIERS ET CAPACITE FLOUE DE CORRECTION.MONTARON B.1978; C.R. ACAD. SCI., A; FR.; DA. 1978; VOL. 286; NO 14; PP. 651-654; ABS. ANGL.; 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

DETERMINATION DU SPECTRE PONDERE ET DE LA DISTANCE DE CODE D'UNE CLASSE DE CODES CYCLIQUESTAIRYAN VI; KHACHATRYAN GG; MKHITARYAN AG et al.1977; AKAD. NAUK ARM. S.S.R., DOKL.; S.S.S.R.; DA. 1977; VOL. 64; NO 3; PP. 165-169; ABS. ARM.; BIBL. 5 REF.Article

BOUNDS FOR EQUIDISTANT CODES AND PARTIAL PROJECTIVE PLANES.HALL JI.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 1; PP. 85-94; BIBL. 12 REF.Article

A NON CONSTRUCTIVE UPPER BOUND ON COVERING RADIUSCOHEN GERARD D.1982; ; FRA; PARIS: ENST; DA. 1982; ENST-C/82001; 5 P.; 30 CM; BIBL. 8 REF.; DEPARTEMENT SYSTEMES ET COMMUNICATIONSReport

ERROR PROBABILITY AND FREE DISTANCE BOUNDS FOR TWO-USER TREE CODES ON MULTIPLE-ACCESS CHANNELSPETERSON RL; COSTELLO DJ JR.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 6; PP. 658-670; BIBL. 19 REF.Article

ON MODIFIED BCH CODESTONG VAN SACH.1979; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1979; VOL. 8; NO 1; PP. 55-66; ABS. RUS; BIBL. 11 REF.Article

BORNES DE LA LONGUEUR DES CODES DISJONCTIFSD'YACHKOV AG; RYKOV VV.1982; PROBLEMY PEREDACI INFORMACII; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 3; PP. 7-13; BIBL. 4 REF.Article

ON THE APPLICATION OF CODING THEORY TO HASHINGPIPPENGER N.1979; I.B.M. J. RES.; USA; DA. 1979; VOL. 23; NO 2; PP. 225-226; BIBL. 4 REF.Article

CODES EN BLOCS BINAIRES SATISFAISANT A UNE MATRICE DE DISTANCES MINIMALES DONNEEKISOV VT; DIMOV DT.1979; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1979; VOL. 8; NO 5-6; PP. 403-420; ABS. ENG; BIBL. 5 REF.Article

CORRECTION DES PAQUETS D'ERREURS ET DES ERREURS INDEPENDANTES PAR DES CODES EN CASCADES GENERALISESZINOV'EV VA; ZYABLOV VV.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 2; PP. 58-70; BIBL. 13 REF.Article

SELF-DUAL CODES OVER GF(3) AND GF(4) OF LENGTH NOT EXCEEDING 16CONWAY JH; PLESS V; SLOANE NJ et al.1979; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 3; PP. 312-322; BIBL. 17 REF.Article

New [47, 15, 16] Linear Binary Block CodeJANOSOV, Martin; HUSAK, Martin; FARKAS, Peter et al.IEEE transactions on information theory. 2008, Vol 54, Num 1, pp 423-424, issn 0018-9448, 2 p.Article