Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LINEAR 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 1139

  • Page / 46
Export

Selection :

  • and

A CLASS OF HIGH RATE CODES FOR BYTE-ORIENTED INFORMATION SYSTEMSSEGUIN GE; ALLARD PE; BHARGAVA VK et al.1983; IEEE TRANSACTIONS ON COMMUNICATIONS; ISSN 0090-6778; USA; DA. 1983; VOL. 31; NO 3; PP. 334-342; BIBL. 8 REF.Article

OVALES ET CODAGESVAN LINT J.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 3-4; PP. 301-305; BIBL. 6 REF.Article

SEPARATING AND COMPLETELY SEPARATING SYSTEMS AND LINEAR CODESBOSE B; RAO TRN.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 7; PP. 665-668; BIBL. 14 REF.Article

RESULTATS SUR LES PARAMETRES DES CODES LINEAIRESWOLFMANN J.1979; REV. CETHEDEC; FRA; DA. 1979; VOL. 16; NO 2; PP. 25-33; ABS. ENG; BIBL. 5 REF.Article

THE WEIGHT-DISTRIBUTION OF A COSET OF A LINEAR CODEASSMUS EF JR; MATTSON HF JR.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 4; PP. 497; BIBL. 5 REF.Article

THE WEIGHT ENUMERATOR POLYNOMIALS OF SOME CLASSES OF CODES WITH COMPOSITE PARITY-CHECK POLYNOMIALS.HELLESETH T.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 20; NO 1; PP. 21-31; BIBL. 6 REF.Article

CODINGS OF NONNEGATIVE INTEGERSKOREC I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 379-388; BIBL. 1 REF.Conference Paper

GOOD LINEAR CODES OF LENGTH 27 AND 28PIRET P.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 2; PP. 227; BIBL. 3 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

CODES ASSOCIES A DES DIVISEURSGOPPA VD.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 1; PP. 33-39; BIBL. 24 REF.Article

OPTIMAL CODES, N-ARCS AND LAGUERRE GEOMETRY.HEISE W.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 403-406; BIBL. 5 REF.Article

BURST DISTRIBUTION OF A LINEAR CODEBAL KISHAN DASS; SIRI KRISHAN WASAN; RUBIN AL et al.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 1; PP. 94-97; BIBL. 3 REF.Article

A NOTE ON REED-MULLER CODESDASS BK; MUTTOO SK.1980; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1980; VOL. 2; NO 4; PP. 345-348; BIBL. 1 REF.Article

INFORMATION SETS IN QUADRATIC-RESIDUE CODESNEWHART DW.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 2-3; PP. 251-256; BIBL. 13 REF.Article

COMPUTERISED SEARCH FOR LINEAR BINARY CODES.HASHIM AA; POZDIAKOV VS.1976; ELECTRON. LETTERS; G.B.; DA. 1976; VOL. 12; NO 14; PP. 350-351; BIBL. 6 REF.Article

CONSTRUCTION D'UN COUPLE DE CODES LINEAIRE DECODABLE UNIVOQUEMENT POUR UN CANAL SANS BRUIT A DEUX UTILISATEURSKHACHATRYAN GG.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 2; PP. 98-101; BIBL. 3 REF.Article

LINEAR CODES FOR SOURCES AND SOURCE NETWORKS: ERROR EXPONENTS, UNIVERSAL CODINGCSISZAR I.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 4; PP. 585-592; BIBL. 23 REF.Article

CHANNELS WITH ADDITIVE ASYMPTOTICALLY MEAN STATIONARY NOISESUJAN S.1981; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1981; VOL. 17; NO 1; PP. 1-15; BIBL. 22 REF.Article

GROUP CODES FOR THE GAUSSIAN BROADCAST CHANNEL WITH TWO RECEIVERSDOWNEY CP; KARLOF JK.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 4; PP. 406-411; BIBL. 6 REF.Article

CORRECTION D'ERREURS PAR DES SOMMES DIRECTES DE CODES ITERATIFS ET EN CASCADESBOYARINOV IM.1980; DOKL. AKAD. NAUK SSSR; ISSN 0002-3264; SUN; DA. 1980; VOL. 252; NO 3; PP. 563-565; BIBL. 4 REF.Article

ODD WEIGHT SYMMETRY IN SOME BINARY CODES.BHARGAVA VK.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 518-520; BIBL. 5 REF.Article

BOUNDS FOR BURST-ERROR AND RANDOM-ERROR CORRECTING LINEAR CODES.BHU DEV SHARMA; BAL KISHAN DASS.1975; INDIAN J. PURE APPL. MATH.; INDIA; DA. 1975; VOL. 6; NO 3; PP. 294-302; BIBL. 4 REF.Article

ON THE UNIQUENESS RESP. NONEXISTENCE OF CERTAIN CODES MEETING THE GRIESMER BOUNDVAN TILBORG H.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 44; NO 1; PP. 16-35; BIBL. 9 REF.Article

GENERALIZED T-DESIGNS AND WEIGHTED MAJORITY DECODINGSAFAVI NAINI R; BLAKE IF.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 3; PP. 261-282; BIBL. 20 REF.Article

DEUX QUESTIONS LIEES AUX GENERALISATIONS ABELIENNES DES CODES DE REED-MULLERGRUSHKO II.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 3; PP. 101-105; BIBL. 7 REF.Article

  • Page / 46