Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("MINIMAL DISTANCE")

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

Origin

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

Results 1 to 25 of 1534

  • Page / 62

Export

Selection :

  • and

DETERMINATION DE LA DISTANCE MINIMALE ENTRE LES ORBITES DES CORPS CELESTESBABENKO YU G.1983; ASTROMETRIJA I ASTROFIZIKA; ISSN 0582-8198; SUN; DA. 1983; NO 49; PP. 22-26; ABS. ENG; BIBL. 2 REF.Article

ON THE MINIMUM DISTANCE OF SOME BCH CODESCOHEN G.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 3; PP. 363; BIBL. 5 REF.Article

RECHERCHE DU DEPLACEMENT MINIMISANT LA DISTANCE ENTRE DEUX CONFIGURATIONS DE POINTS INDICES PAR UN MEME ENSEMBLE FINI: METHODE ET APPLICATIONS EN RECONNAISSANCE DES FORMES ET EN ANALYSE DES DONNEES CUBIQUESBOURGEOIS PHILIPPE.1980; ; FRA; DA. 1980; 114 P.; 30 CM; BIBL. 25 REF.; TH. 3E CYCLE: STAT. MATH., ANAL. DONNEES/PARIS 6/1980Thesis

GENERALIZED MINIMUM DISTANCE DECODING ON MAJORITY LOGIC DECODABLE CODESTAI YANG HWANG; SHENG UEI GUAN.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 5; PART. 1; PP. 790-792; BIBL. 9 REF.Article

ROBUST ESTIMATION VIA MINIMUM DISTANCE METHODSMILLAR PW.1981; Z. WAHRSCHEINLICHKEITS THEOR. VERW. GEB.; ISSN 0044-3719; DEU; DA. 1981; VOL. 55; NO 1; PP. 73-89; BIBL. 33 REF.Article

ON A METHOD FOR ESTABLISHING THE MINIMUM DISTANCE OF ABELIAN CODESPETHO A; REMENYI G.1982; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 2; PP. 97-105; ABS. RUS; BIBL. 5 REF.Article

A NOTE ON MINIMUM DISTANCE ESTIMATESDROSSOS CA; PHILIPPOU AN.1980; ANN. INST. STATIST. MATH.; JPN; DA. 1980; VOL. 32; NO 1; PP. 121-123; BIBL. 7 REF.Article

BOUNDS ON GOPPA CODES.RETTER CT.1976; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 4; PP. 476-482; BIBL. 8 REF.Article

CASCADED DECODING WITH RESPECT TO MINIMAL GENERALIZED DISTANCEDUMER II; ZINOV'EV VA; ZYABLOV VV et al.1981; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1981; VOL. 10; NO 1; PP. 1.-17; BIBL. 7 REF.; IDEM RUSArticle

ON BOUNDS FOR CODES IN HAMMING SCHEMES AND JOHNSON SCHEMESDE VROEDT C.1980; DELFT PROG. REP.; ISSN 501115; NLD; DA. 1980; VOL. 5; NO 2; PP. 78-91; BIBL. 3 REF.Article

ANALYSIS OF THE COMPUTATIONAL AND STORAGE REQUIREMENTS FOR THE MINIMUM-DISTANCE DECODING OF CONVOLUTIONAL CODESNG WH; GOODMAN RMF.1979; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1979; VOL. 126; NO 1; PP. 29-34; BIBL. 5 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

SOFT-DECISION MINIMUM-DISTANCE SEQUENTIAL DECODING ALGORITHM FOR CONVOLUTIONAL CODESGOODMAN RMF; WINFIELD AFT.1981; IEE PROC., PART F; ISSN 0143-7070; GBR; DA. 1981; VOL. 128; NO 3; PP. 179-186; BIBL. 7 REF.Article

BINARY CODES WITH A MINIMUM DISTANCE OF FOURBEST MR.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 6; PP. 738-742; BIBL. 5 REF.Article

DISTANCE MINIMALE ET ENUMERATION DE POIDS DES CODES LINEAIRES.COHEN G.1976; ; S.L.; DA. 1976; PP. 1-104; BIBL. 4 P. 1/2; (THESE DOCT. 3EME CYCLE, SPEC. MATH.; PIERRE ET MARIE CURIE PARIS VI)Thesis

A GENERALIZATION OF THE BCH BOUND FOR CYCLIC CODES, INCLUDING THE HARTMANN-TZENG BOUNDROOS C.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 33; NO 2; PP. 229-232; BIBL. 4 REF.Article

HOW TO COMPUTE THE MINIMUM DISTANCE FOR CYCLIC AN-CODES OVER AN ARBITRARY BASE. I: ELEMENTARY METHODSECKER A.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 219-240; BIBL. 21 REF.Article

MINIMUM DISTANCE AND ROBUST ESTIMATIONPARR WC; SCHUCANY WR.1980; J. AM. STAT. ASSOC.; ISSN 0003-1291; USA; DA. 1980; VOL. 75; NO 371; PP. 616-624; BIBL. 28 REF.Article

Chain of Separable Binary Goppa Codes and Their Minimal DistanceBEZZATEEV, Sergey; SHEKHUNOVA, Natalia.IEEE transactions on information theory. 2008, Vol 54, Num 12, pp 5773-5778, issn 0018-9448, 6 p.Article

Turbo codes with modified Welch-Costas interleaversTRIFINA, Lucian; MUNTEANU, Valeriu; TARNICERIU, Daniela et al.Annales des télécommunications. 2007, Vol 62, Num 9-10, pp 1045-1052, issn 0003-4347, 8 p.Article

New construction for classes of majority logic decodable codes with even minimum distancesCHEN ZHI; FAN PINGZHI; JIN FAN et al.Electronics Letters. 1991, Vol 27, Num 7, pp 549-550, issn 0013-5194, 2 p.Article

ON THE ROBUSTNESS OF MINIMUM DISTANCE DECODINGPATEK B.1982; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 3; PP. 217-229; ABS. RUS; BIBL. 4 REF.Article

A NEW ONE-STEP MAJORITY LOGIC DECODABLE BINARY CODEMUSCATI ZAH; SHIVA SGS.1979; DIGIT. PROCESS.; CHE; DA. 1979; VOL. 5; NO 3-4; PP. 283-285; ABS. FRE/GER; BIBL. 9 REF.Article

THE MINIMUM DISTANCE METHOD OF TESTINGPOLLARD D.1980; METRIKA; DEU; DA. 1980; VOL. 27; NO 1; PP. 43-70; BIBL. 36 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

  • Page / 62