AAAAAA
Results:
1-8
|
Results: 8
Authors:
DELSARTE P
LEVENSHTEIN VI
Citation: P. Delsarte et Vi. Levenshtein, ASSOCIATION SCHEMES AND CODING THEORY, IEEE transactions on information theory, 44(6), 1998, pp. 2477-2504
Authors:
LEVENSHTEIN VI
Citation: Vi. Levenshtein, RECONSTRUCTING OBJECTS BY THE MINIMUM NUMBER OF ERRONEOUS PATTERNS, Doklady Akademii nauk. Rossijskaa akademia nauk, 354(5), 1997, pp. 593-596
Authors:
HELLESETH T
KLOVE T
LEVENSHTEIN VI
Citation: T. Helleseth et al., ON THE INFORMATION FUNCTION OF AN ERROR-CORRECTING CODE, IEEE transactions on information theory, 43(2), 1997, pp. 549-557
Authors:
FAZEKAS G
LEVENSHTEIN VI
Citation: G. Fazekas et Vi. Levenshtein, ON UPPER-BOUNDS FOR CODE DISTANCE AND COVERING RADIUS OF DESIGNS IN POLYNOMIAL METRIC-SPACES, J COMB TH A, 70(2), 1995, pp. 267-288
Authors:
LEVENSHTEIN VI
Citation: Vi. Levenshtein, KRAWTCHOUK POLYNOMIALS AND UNIVERSAL BOUNDS FOR CODES AND DESIGNS IN HAMMING-SPACES, IEEE transactions on information theory, 41(5), 1995, pp. 1303-1321
Authors:
HELLESETH T
KLOVE T
LEVENSHTEIN VI
YTREHUS O
Citation: T. Helleseth et al., BOUNDS ON THE MINIMUM SUPPORT WEIGHTS, IEEE transactions on information theory, 41(2), 1995, pp. 432-440
Authors:
ERICSON T
LEVENSHTEIN VI
Citation: T. Ericson et Vi. Levenshtein, SUPERIMPOSED CODES IN THE HAMMING SPACE, IEEE transactions on information theory, 40(6), 1994, pp. 1882-1893
Authors:
LEVENSHTEIN VI
VINCK AJH
Citation: Vi. Levenshtein et Ajh. Vinck, PERFECT (D, K)-CODES CAPABLE OF CORRECTING SINGLE PEAK-SHIFTS, IEEE transactions on information theory, 39(2), 1993, pp. 656-662
Risultati:
1-8
|