Searching for authors named "Alexander Barg" – sorted by Relevance.
-
The Matroid Of Supports Of A Linear Code
- THE MATROID OF SUPPORTS OF A LINEAR CODE Alexander Barg Abstract A relation between
- Cited by 8 (2 self) – Add To MetaCart
-
Error Exponents of Expander Codes Under Linear-Complexity Decoding
- -complexity decoding by Alexander Barg 1 ;2 Math. Research Bell Labs, Lucent Technologies 700 Mountain Ave., Murray
- Cited by 6 (1 self) – Add To MetaCart
-
Complexity Issues in Coding Theory
- This paper gives concatenated codes with uniform construction complexity of order n
- Cited by 13 (1 self) – Add To MetaCart
-
A Class of I.p.p. Codes With Efficient Identification
- by Alexander Barg 1;2 Math. Research Bell Labs, Lucent Technologies 700 Mountain Ave., Murray Hil,. NJ 07974
- Cited by 5 (1 self) – Add To MetaCart
-
Distance properties of expander codes
- arXiv:cs/0409010v1 [cs.IT] 7 Sep 2004 DISTANCE PROPERTIES OF EXPANDER CODES ALEXANDER BARG
- Cited by 3 (0 self) – Add To MetaCart
-
Binomial Moments of the Distance Distribution and the Probability of Undetected Error
- BARG abarg@(email omitted); Bell Laboratories, Lucent Technologies, 600 Mountain Avenue 2C-375
- Cited by 6 (3 self) – Add To MetaCart
-
Minimal Vectors in Linear Codes and Sharing of Secrets
- Minimal Vectors in Linear Codes and Sharing of Secrets Alexei Ashikhmin y Alexander Barg y; z
- Cited by 3 (2 self) – Add To MetaCart
-
Linear-Time Decodable, Capacity Achieving Binary Codes With Exponentially Falling Error Probability
- Alexander Barg Gilles Zemor y September 28, 2000 Abstract We show that expander codes attain
- Cited by 2 (0 self) – Add To MetaCart
-
A Quantum Decoding Algorithm of the Simplex Code
- A quantum decoding algorithm of the simplex code Alexander Barg Shiyu Zhou y Abstract We
- Cited by 1 (0 self) – Add To MetaCart
-
Strengthening the Varshamov-Gilbert bound
- Barg 1 Bell Labs, Lucent Technologies 600 Mountain avenue 2C-375 Murray Hill, NJ 07974-0636 abarg
- Add To MetaCart

