Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DISTANCE CODE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 217

  • Page / 9
Export

Selection :

  • and

CODAGE DES CODES EN CASCADE GENERALISESBLOKH EH L; ZYABLOV VV.1974; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1974; VOL. 10; NO 3; PP. 45-50; BIBL. 10 REF.Article

CASCADE EQUAL-WEIGHT CODES AND MAXIMAL PACKINGSZINOVIEV VA.1983; PROBLEMS OF CONTROL AND INFORMATION THEORY; ISSN 0370-2529; HUN; DA. 1983; VOL. 12; NO 1; PP. 3-10; ABS. RUS; BIBL. 13 REF.Article

PROBLEME DE PERCAGE DES FACES D'UN CUBE-UNITE A N DIMENSIONSKOSPANOV EH SH.1977; DISKRETN. ANAL.; SUN; DA. 1977; NO 31; PP. 57-60; BIBL. 6 REF.Article

BORNES SUPERIEURES DU NOMBRE DE POINTS D'UN CODE BINAIRE AVEC UNE DISTANCE DE CODE DONNEESIDEL'NIKOV VM.1974; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1974; VOL. 10; NO 2; PP. 43-51; BIBL. 7 REF.Article

EFFICACITE D'UNE METHODE SIMPLE DE SYNCHRONISATION DES CODES UNIFORMES ET NON UNIFORMESSHTAR'KOV YU M.1974; IN: VOPR. KIBERN. SZHATIE DANNYKH.; MOSKVA; AKAD. NAUK SSSR; DA. 1974; PP. 143-154; BIBL. 4 REF.Book Chapter

MODULATION DELTA PAR CODEKAGAN VG; TITOV GI.1974; AVTOMETRIJA; S.S.S.R.; DA. 1974; NO 5; PP. 64-72; BIBL. 3 REF.Article

NEW UPPER BOUNDS ON THE RATE OF A CODE VIA THE DELSARTE - MACWILLIAMS INEQUALITIES.MCELIECE RJ; RODEMICH ER; RUMSEY H JR et al.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 2; PP. 157-166; BIBL. 8 REF.Article

BOUNDS FOR UNRESTRICTED CODES, BY LINEAR PROGRAMMINGDELSARTE P.1972; PHILIPS RES. REP.; NETHERL.; DA. 1972; VOL. 27; NO 3; PP. 272-289; BIBL. 17 REF.Serial Issue

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

CONSTRUCTION OF ERROR CORRECTING CODES BY INTERPOLATIONMANDELBAUM DM.1979; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 1; PP. 27-35; BIBL. 32 REF.Article

STRUCTURE PONDEREE DE QUELQUES CLASSES DE CODES CYCLIQUES DE TYPE QTAIRYAN VI.1979; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1979; VOL. 8; NO 2; PP. 151-159; BIBL. 11 REF.; IDEM ENGArticle

SUR UNE CLASSE DE CODES AN ARITHMETIQUES CYCLIQUESTSISKARIDZE DV.1975; SOOBSHCH. AKAD. NAUK GRUZ. S.S.R.; S.S.S.R.; DA. 1975; VOL. 78; NO 2; PP. 317-320; ABS. GEORGIEN ANGL.; BIBL. 2 REF.Article

ESTIMATION DE LA DISTRIBUTION DE LA DISTANCE DE CODE DANS LES CODES LINEAIRES ALEATOIRESKOSHELEV VN.1974; IN: KODIROVANIE SLOZHNYKH SIST.; MOSKVA; NAUKA; DA. 1974; PP. 87-90; BIBL. 3 REF.Book Chapter

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

POSSIBILITE DE CORRECTION D'ERREURS PAR DES CODES DE CONVOLUTION EN CASCADES GENERALISESSKOPINTSEV OD.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 27-37; BIBL. 11 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

CODES ARITHMETIQUES NON BINAIRES AVEC UNE DISTANCE MINIMALE ELEVEEBOYARINOV IM.1975; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1975; VOL. 11; NO 1; PP. 57-63; BIBL. 10 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

  • Page / 9