AAAAAA

   
Results: 1-16 |
Results: 16
Asymptotically good quantum codes - art. no. 032311
Authors: Ashikhmin, A Litsyn, S Tsfasman, MA
Citation: A. Ashikhmin et al., Asymptotically good quantum codes - art. no. 032311, PHYS REV A, 6303(3), 2001, pp. 2311
On the distance distributions of BCH codes and their duals
Authors: Krasikov, I Litsyn, S
Citation: I. Krasikov et S. Litsyn, On the distance distributions of BCH codes and their duals, DES CODES C, 23(2), 2001, pp. 223-231
Binary B-2-sequences: A new upper bound
Authors: Cohen, G Litsyn, S Zemor, G
Citation: G. Cohen et al., Binary B-2-sequences: A new upper bound, J COMB TH A, 94(1), 2001, pp. 152-155
Estimates of the distance distribution of codes and designs
Authors: Ashikhmin, A Barg, A Litsyn, S
Citation: A. Ashikhmin et al., Estimates of the distance distribution of codes and designs, IEEE INFO T, 47(3), 2001, pp. 1050-1061
An improved upper bound on the minimum distance of doubly-even self-dual codes
Authors: Krasikov, I Litsyn, S
Citation: I. Krasikov et S. Litsyn, An improved upper bound on the minimum distance of doubly-even self-dual codes, IEEE INFO T, 46(1), 2000, pp. 274-278
A new upper bound on codes decodable into size-2 lists
Authors: Ashikhmin, A Barg, A Litsyn, S
Citation: A. Ashikhmin et al., A new upper bound on codes decodable into size-2 lists, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 239-244
New bounds on covering radius as a function of dual distance
Authors: Laihonen, T Litsyn, S
Citation: T. Laihonen et S. Litsyn, New bounds on covering radius as a function of dual distance, SIAM J DISC, 12(2), 1999, pp. 243-251
On binary constructions of quantum codes
Authors: Cohen, G Encheva, S Litsyn, S
Citation: G. Cohen et al., On binary constructions of quantum codes, IEEE INFO T, 45(7), 1999, pp. 2495-2498
Asymptotically exact bounds on the size of high-order spectral-null codes
Authors: Freiman, G Litsyn, S
Citation: G. Freiman et S. Litsyn, Asymptotically exact bounds on the size of high-order spectral-null codes, IEEE INFO T, 45(6), 1999, pp. 1798-1807
Upper bounds on the size of quantum codes
Authors: Ashikhmin, A Litsyn, S
Citation: A. Ashikhmin et S. Litsyn, Upper bounds on the size of quantum codes, IEEE INFO T, 45(4), 1999, pp. 1206-1215
New upper bounds on generalized weights
Authors: Ashikhmin, A Barg, A Litsyn, S
Citation: A. Ashikhmin et al., New upper bounds on generalized weights, IEEE INFO T, 45(4), 1999, pp. 1258-1263
New upper bounds on error exponents
Authors: Litsyn, S
Citation: S. Litsyn, New upper bounds on error exponents, IEEE INFO T, 45(2), 1999, pp. 385-398
On the distance distribution of duals of BCH codes
Authors: Krasikov, I Litsyn, S
Citation: I. Krasikov et S. Litsyn, On the distance distribution of duals of BCH codes, IEEE INFO T, 45(1), 1999, pp. 247-250
More on the distance distribution of BCH codes
Authors: Keren, O Litsyn, S
Citation: O. Keren et S. Litsyn, More on the distance distribution of BCH codes, IEEE INFO T, 45(1), 1999, pp. 251-255
An updated table of the best binary codes known
Authors: Litsyn, S
Citation: S. Litsyn, An updated table of the best binary codes known, HANDBOOK OF CODING THEORY, VOLS I & II, 1998, pp. 463
Covering radius
Authors: Brualdi, RA Litsyn, S Pless, VS
Citation: Ra. Brualdi et al., Covering radius, HANDBOOK OF CODING THEORY, VOLS I & II, 1998, pp. 755-826
Risultati: 1-16 |