Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("METRIQUE LEE")

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

Author Country

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

Results 1 to 6 of 6

  • Page / 1
Export

Selection :

  • and

LEE METRIC CODES OVERINTEGER RESIDUE RINGSCHANDRA SATYANARAYANA.1979; IEEE TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 2; PP. 250-254; BIBL. 10 REF.Article

ON PERFECT CODES IN THE LEE-METRICASTOLA J.1978; ANN. UNIV. TURKU. A 1; FIN; DA. 1978; NO 176; 56 P.; BIBL. 19 REF.Serial Issue

A MODIFICATION OF THE ELIAS-BOUND AND NON EXISTENCE THEOREMS FOR PERFECT CODES IN THE LEE-METRICLEPISTO T.1981; INFORM. CONTROL; ISSN 0019-9958; FRA; DA. 1981; VOL. 49; NO 2; PP. 109-124; BIBL. 9 REF.Article

CODES SIMULTANEMENT PARFAITS PAR RAPPORT AUX METRIQUES DE HAMMING ET DE LEEDODUNEKOV SM.1972; GOD. SOFIJSK. UNIV., MAT. FAK.; BALG.; DA. 1972-1973 PARU 1976; VOL. 67; PP. 561-564; ABS. ANGL.; BIBL. 2 REF.Article

On the identification of vertices and edges using cyclesHONKALA, Iiro; KARPOVSKY, Mark G; LITSYN, Simon et al.Lecture notes in computer science. 2001, pp 308-314, issn 0302-9743, isbn 3-540-42911-5Conference Paper

Splittings of cyclic groups, tilings of Euclidean space, and perfect shift codesTAMM, U.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 245Conference Paper

  • Page / 1