AAAAAA

   
Results: 1-13 |
Results: 13
A hypergraph approach to the identifying parent property: The case of multiple parents
Authors: Barg, A Cohen, G Encheva, S Kabatiansky, G Zemor, G
Citation: A. Barg et al., A hypergraph approach to the identifying parent property: The case of multiple parents, SIAM J DISC, 14(3), 2001, pp. 423-431
Linear codes with exponentially many light vectors
Authors: Ashikhmin, A Barg, A Vladut, S
Citation: A. Ashikhmin et al., Linear codes with exponentially many light vectors, J COMB TH A, 96(2), 2001, pp. 396-399
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
Concatenated codes with fixed inner code and random outer code
Authors: Barg, A Justesen, J Thommesen, C
Citation: A. Barg et al., Concatenated codes with fixed inner code and random outer code, IEEE INFO T, 47(1), 2001, pp. 361-365
Strengthening the Gilbert-Varshamov bound
Authors: Barg, A Guritman, S Simonis, J
Citation: A. Barg et al., Strengthening the Gilbert-Varshamov bound, LIN ALG APP, 307(1-3), 2000, pp. 119-129
A new upper bound on the reliability function of the Gaussian channel
Authors: Ashikhmin, AE Barg, A Litsyn, SN
Citation: Ae. Ashikhmin et al., A new upper bound on the reliability function of the Gaussian channel, IEEE INFO T, 46(6), 2000, pp. 1945-1961
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
Binomial moments of the distance distribution and the probability of undetected error
Authors: Barg, A Ashikhmin, A
Citation: A. Barg et A. Ashikhmin, Binomial moments of the distance distribution and the probability of undetected error, DES CODES C, 16(2), 1999, pp. 103-116
Linear-time binary codes correcting localized erasures
Authors: Barg, A Zhou, SY
Citation: A. Barg et Sy. Zhou, Linear-time binary codes correcting localized erasures, IEEE INFO T, 45(7), 1999, pp. 2545-2550
On the complexity of minimum distance decoding of long linear codes
Authors: Barg, A Krouk, E van Tilborg, HCA
Citation: A. Barg et al., On the complexity of minimum distance decoding of long linear codes, IEEE INFO T, 45(5), 1999, pp. 1392-1405
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
Binomial moments of the distance distribution: Bounds and applications
Authors: Ashikhmin, A Barg, A
Citation: A. Ashikhmin et A. Barg, Binomial moments of the distance distribution: Bounds and applications, IEEE INFO T, 45(2), 1999, pp. 438-452
Complexity issues in coding theory
Authors: Barg, A
Citation: A. Barg, Complexity issues in coding theory, HANDBOOK OF CODING THEORY, VOLS I & II, 1998, pp. 649
Risultati: 1-13 |