| 2008 |
|---|
| 60 | EE | N. Prasanth Anthapadmanabhan,
Alexander Barg:
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing
CoRR abs/0802.3419: (2008) |
| 59 | EE | Alexander Barg,
Arya Mazumdar,
Gilles Zémor:
Codes on hypergraphs
CoRR abs/0808.3453: (2008) |
| 58 | EE | Alexander Barg,
Dmitry Yu. Nogin:
A functional view of upper bounds on codes
CoRR abs/0809.0091: (2008) |
| 57 | EE | Andrew Duggan,
Alexander Barg:
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes.
IEEE Transactions on Information Theory 54(11): 5012-5018 (2008) |
| 56 | EE | N. Prasanth Anthapadmanabhan,
Alexander Barg,
Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption.
IEEE Transactions on Information Theory 54(6): 2678-2689 (2008) |
| 2007 |
|---|
| 55 | EE | Andrew Duggan,
Alexander Barg:
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes
CoRR abs/cs/0701018: (2007) |
| 54 | EE | Alexander Barg,
Punarbasu Purkayastha:
Bounds on ordered codes and orthogonal arrays
CoRR abs/cs/0702033: (2007) |
| 2006 |
|---|
| 53 | EE | N. Prasanth Anthapadmanabhan,
Alexander Barg,
Ilya Dumer:
On the Fingerprinting Capacity Under the Marking Assumption
CoRR abs/cs/0612073: (2006) |
| 52 | EE | Alexander Barg,
Oleg R. Musin:
Codes in spherical caps
CoRR abs/math/0606734: (2006) |
| 51 | EE | Alexander Barg,
Gilles Zémor:
Distance properties of expander codes.
IEEE Transactions on Information Theory 52(1): 78-90 (2006) |
| 50 | EE | Alexander Barg,
Dmitry Yu. Nogin:
A bound on Grassmannian codes.
J. Comb. Theory, Ser. A 113(8): 1629-1635 (2006) |
| 2005 |
|---|
| 49 | EE | Alexander Barg,
Gregory A. Kabatiansky:
Fingerprinting.
Encyclopedia of Cryptography and Security 2005 |
| 48 | EE | Alexander Barg,
Gilles Zémor:
Multilevel expander codes
CoRR abs/cs/0502079: (2005) |
| 47 | EE | Alexander Barg,
Dmitry Yu. Nogin:
A bound on Grassmannian codes
CoRR abs/cs/0512024: (2005) |
| 46 | EE | Alexander Barg,
Dmitry Yu. Nogin:
Spectral approach to linear programming bounds on codes
CoRR abs/cs/0512025: (2005) |
| 45 | EE | Alexander Barg,
Andrew McGregor:
Distance distribution of binary codes and the error probability of decoding.
IEEE Transactions on Information Theory 51(12): 4237-4246 (2005) |
| 44 | EE | Alexander Barg,
Gilles Zémor:
Concatenated codes: serial and parallel.
IEEE Transactions on Information Theory 51(5): 1625-1634 (2005) |
| 43 | EE | Alexander Barg,
Dmitry Yu. Nogin:
Correction to "Bounds on Packings of Spheres in the Grassmann Manifold".
IEEE Transactions on Information Theory 51(7): 2732- (2005) |
| 2004 |
|---|
| 42 | EE | Alexander Barg:
On the asymptotic accuracy of the union bound
CoRR abs/cs/0412111: (2004) |
| 41 | EE | Alexander Barg:
Improved error bounds for the erasure/list scheme: the binary and spherical cases
CoRR cs.IT/0407010: (2004) |
| 40 | EE | Alexander Barg,
Andrew McGregor:
Distance distribution of binary codes and the error probability of decoding
CoRR cs.IT/0407011: (2004) |
| 39 | EE | Alexander Barg,
Gilles Zémor:
Distance properties of expander codes
CoRR cs.IT/0409010: (2004) |
| 38 | | Alexander Barg:
Improved error bounds for the erasure/list scheme: the binary and spherical cases.
IEEE Transactions on Information Theory 50(10): 2503-2514 (2004) |
| 37 | EE | Alexander Barg,
Gregory A. Kabatiansky:
A class of I.P.P. codes with efficient identification.
J. Complexity 20(2-3): 137-147 (2004) |
| 36 | EE | Alexander Barg,
Gilles Zémor:
Error Exponents of Expander Codes under Linear-Complexity Decoding.
SIAM J. Discrete Math. 17(3): 426-445 (2004) |
| 2003 |
|---|
| 35 | | Alexander Barg,
G. R. Blakley,
Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors.
IEEE Transactions on Information Theory 49(4): 852-865 (2003) |
| 2002 |
|---|
| 34 | | Alexei E. Ashikhmin,
Alexander Barg:
Bounds on the Covering Radius of Linear Codes.
Des. Codes Cryptography 27(3): 261-269 (2002) |
| 33 | | Alexander Barg:
A low-rate bound on the reliability of a quantum discrete memoryless channel.
IEEE Transactions on Information Theory 48(12): 3096-3100 (2002) |
| 32 | | Alexander Barg,
Gilles Zémor:
Error exponents of expander codes.
IEEE Transactions on Information Theory 48(6): 1725-1729 (2002) |
| 31 | | Alexander Barg,
Dmitry Yu. Nogin:
Bounds on packings of spheres in the Grassmann manifold.
IEEE Transactions on Information Theory 48(9): 2450-2454 (2002) |
| 30 | | Alexander Barg,
G. David Forney Jr.:
Random codes: Minimum distances and error exponents.
IEEE Transactions on Information Theory 48(9): 2568-2573 (2002) |
| 29 | EE | Alexander Barg:
On Some Polynomials Related to Weight Enumerators of Linear Codes.
SIAM J. Discrete Math. 15(2): 155-164 (2002) |
| 2001 |
|---|
| 28 | EE | Alexander Barg,
Gérard D. Cohen,
Sylvia B. Encheva,
Gregory A. Kabatiansky,
Gilles Zémor:
A hypergraph approach to the identifying parent property: the case of multiple parents.
Electronic Notes in Discrete Mathematics 6: 1-3 (2001) |
| 27 | EE | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Estimates of the Distance Distribution of Codes and Designs.
Electronic Notes in Discrete Mathematics 6: 4-14 (2001) |
| 26 | | Alexander Barg,
Jørn Justesen,
Christian Thommesen:
Concatenated codes with fixed inner code and random outer code.
IEEE Transactions on Information Theory 47(1): 361-365 (2001) |
| 25 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Estimates of the distance distribution of codes and designs.
IEEE Transactions on Information Theory 47(3): 1050-1061 (2001) |
| 24 | EE | Alexei E. Ashikhmin,
Alexander Barg,
Serge G. Vladut:
Linear Codes with Exponentially Many Light Vectors.
J. Comb. Theory, Ser. A 96(2): 396-399 (2001) |
| 23 | EE | Alexander Barg,
Gérard D. Cohen,
Sylvia B. Encheva,
Gregory A. Kabatiansky,
Gilles Zémor:
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents.
SIAM J. Discrete Math. 14(3): 423-431 (2001) |
| 2000 |
|---|
| 22 | | Alexei E. Ashikhmin,
Alexander Barg,
Emanuel Knill,
Simon Litsyn:
Quantum error detection I: Statement of the problem.
IEEE Transactions on Information Theory 46(3): 778-788 (2000) |
| 21 | | Alexei E. Ashikhmin,
Alexander Barg,
Emanuel Knill,
Simon Litsyn:
Quantum error detection II: Bounds.
IEEE Transactions on Information Theory 46(3): 789-800 (2000) |
| 20 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
A new upper bound on the reliability function of the Gaussian channel.
IEEE Transactions on Information Theory 46(6): 1945-1961 (2000) |
| 1999 |
|---|
| 19 | EE | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Polynomial method in coding and information theory
CoRR math.CO/9910175: (1999) |
| 18 | | Alexander Barg,
Alexei E. Ashikhmin:
Binomial Moments of the Distance Distribution and the Probability of Undetected Error.
Des. Codes Cryptography 16(2): 103-116 (1999) |
| 17 | | Alexei E. Ashikhmin,
Alexander Barg:
Binomial Moments of the Distance Distribution: Bounds and Applications.
IEEE Transactions on Information Theory 45(2): 438-452 (1999) |
| 16 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
New Upper Bounds on Generalized Weights.
IEEE Transactions on Information Theory 45(4): 1258-1263 (1999) |
| 15 | | Alexander Barg,
Evgueni Krouk,
Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes.
IEEE Transactions on Information Theory 45(5): 1392-1405 (1999) |
| 14 | | Alexander Barg,
Shiyu Zhou:
Linear-time binary codes correcting localized erasures.
IEEE Transactions on Information Theory 45(7): 2547-2552 (1999) |
| 1998 |
|---|
| 13 | | Alexei E. Ashikhmin,
Alexander Barg:
Minimal Vectors in Linear Codes.
IEEE Transactions on Information Theory 44(5): 2010-2017 (1998) |
| 1997 |
|---|
| 12 | | Alexander Barg:
Minimum Distance Decoding Algorithms for Linear Codes.
AAECC 1997: 1-14 |
| 11 | EE | Alexander Barg:
The Matroid of Supports of A Linear Code.
Appl. Algebra Eng. Commun. Comput. 8(2): 165-172 (1997) |
| 10 | EE | Alexander Barg:
A large family of sequences with low periodic correlation.
Discrete Mathematics 176(1-3): 21-27 (1997) |
| 9 | EE | Alexander Barg:
Complexity Issues in Coding Theory
Electronic Colloquium on Computational Complexity (ECCC) 4(46): (1997) |
| 1996 |
|---|
| 8 | EE | Alexander Barg:
Two Families of Low-Correlated Binary Sequences.
Appl. Algebra Eng. Commun. Comput. 7(6): 433-437 (1996) |
| 1995 |
|---|
| 7 | | Alexei E. Ashikhmin,
Alexander Barg,
Gérard D. Cohen,
Llorenç Huguet i Rotger:
Variations on Minimal Codewords in Linear Codes.
AAECC 1995: 96-105 |
| 6 | | Alexei E. Ashikhmin,
Alexander Barg:
Minimal Supports in Linear Codes.
IMA Conf. 1995: 13 |
| 5 | | Valeri Korjik,
Michael Ivkov,
Yuri Merinovich,
Alexander Barg,
Henk C. A. van Tilborg:
A Broadcast Key Distribution Scheme Based on Block Designs.
IMA Conf. 1995: 2-12 |
| 1993 |
|---|
| 4 | | Alexander Barg:
Incomplete Sums, DC-Constrained Codes, and Codes that Maintain Synchronization.
Des. Codes Cryptography 3(2): 105-116 (1993) |
| 1992 |
|---|
| 3 | | Alexander Barg,
Ilya Dumer:
On computing the weight spectrum of cyclic codes.
IEEE Transactions on Information Theory 38(4): 1382- (1992) |
| 1991 |
|---|
| 2 | | Alexander Barg:
Exponential Sums and Constrained Error-Correcting Codes.
Algebraic Coding 1991: 16-22 |
| 1 | | Alexander Barg,
Simon Litsyn:
DC-constrained codes from Hadamard matrices.
IEEE Transactions on Information Theory 37(3): 801-807 (1991) |
