| 2013 | ||
|---|---|---|
| j47 | Alexander Barg, Wei-Hsuan Yu: New Bounds for Spherical Two-Distance Sets. Experimental Mathematics 22(2): 187-194 (2013) | |
| j46 | Woomyoung Park, Alexander Barg: Polar Codes for $q$-Ary Channels, $q=2^{r}$. IEEE Transactions on Information Theory 59(2): 955-969 (2013) | |
| j45 | Alexander Barg, Grigory Kabatiansky: Robust Parent-Identifying Codes and Combinatorial Arrays. IEEE Transactions on Information Theory 59(2): 994-1003 (2013) | |
| j44 | Arya Mazumdar, Alexander Barg, Gilles Zémor: Constructions of Rank Modulation Codes. IEEE Transactions on Information Theory 59(2): 1018-1029 (2013) | |
| i27 | Alexander Barg, Arya Mazumdar, Rongrong Wang: Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery. CoRR abs/1303.1847 (2013) | |
| i26 | Alexander Barg, Marcelo Firer, Marcos Vinicius Spreafico, Luciano Vianna Felix: Linear codes on posets with extension property. CoRR abs/1304.2263 (2013) | |
| 2012 | ||
| c24 | Alexander Barg, Marcelo Firer: Translation association schemes, poset metrics, and the shape enumerator of codes. ISIT 2012: 101-105 | |
| c23 | ||
| 2011 | ||
| j43 | Alexander Barg, Oleg R. Musin: Bounds on sets with few distances. J. Comb. Theory, Ser. A 118(4): 1465-1474 (2011) | |
| j42 | Alexander Barg, Arya Mazumdar: On the Number of Errors Correctable with Codes on Graphs. IEEE Transactions on Information Theory 57(2): 910-919 (2011) | |
| j41 | Arya Mazumdar, Alexander Barg, Navin Kashyap: Coding for High-Density Recording on a 1-D Granular Magnetic Medium. IEEE Transactions on Information Theory 57(11): 7403-7417 (2011) | |
| c22 | Alexander Barg, Grigory Kabatiansky: Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk). ICITS 2011: 202-205 | |
| c21 | Arya Mazumdar, Alexander Barg: General constructions of deterministic (S)RIP matrices for compressive sampling. ISIT 2011: 678-682 | |
| c20 | Arya Mazumdar, Alexander Barg, Gilles Zémor: Constructions of rank modulation codes. ISIT 2011: 869-873 | |
| c19 | Alexander Barg, Gilles Zémor: List decoding of product codes by the MinSum algorithm. ISIT 2011: 1273-1277 | |
| c18 | ||
| c17 | Woomyoung Park, Alexander Barg: The ordered Hamming metric and ordered symmetric channels. ISIT 2011: 2283-2287 | |
| r2 | Alexander Barg, Gregory A. Kabatiansky: Fingerprinting. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 465-467 | |
| i25 | Woomyoung Park, Alexander Barg: Multilevel polarization for nonbinary codes and parallel channels. CoRR abs/1107.4965 (2011) | |
| i24 | Arya Mazumdar, Alexander Barg, Gilles Zémor: Constructions of Rank Modulation Codes. CoRR abs/1110.2557 (2011) | |
| i23 | Alexander Barg, Grigory Kabatiansky: Robust parent-identifying codes and combinatorial arrays. IACR Cryptology ePrint Archive 2011: 227 (2011) | |
| 2010 | ||
| j40 | Alexander Barg, Arya Mazumdar: Codes in permutations and error correction for rank modulation. IEEE Transactions on Information Theory 56(7): 3158-3165 (2010) | |
| j39 | Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik: Secret Key Generation for a Pairwise Independent Network Model. IEEE Transactions on Information Theory 56(12): 6482-6489 (2010) | |
| c16 | Alexander Barg, Arya Mazumdar: Codes in permutations and error correction for rank modulation. ISIT 2010: 854-858 | |
| c15 | Arya Mazumdar, Alexander Barg, Navin Kashyap: Coding for high-density magnetic recording. ISIT 2010: 978-982 | |
| c14 | ||
| c13 | ||
| c12 | Alexander Barg, Arya Mazumdar: Small ensembles of sampling matrices constructed from coding theory. ISIT 2010: 1963-1967 | |
| c11 | N. Prasanth Anthapadmanabhan, Alexander Barg: Two-level fingerprinting: Stronger definitions and code constructions. ISIT 2010: 2528-2532 | |
| i22 | Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik: Secret Key Generation for a Pairwise Independent Network Model. CoRR abs/1007.3518 (2010) | |
| i21 | Arya Mazumdar, Alexander Barg, Navin Kashyap: Coding for High-Density Recording on a 1-D Granular Magnetic Medium. CoRR abs/1012.1895 (2010) | |
| 2009 | ||
| c10 | Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik: Perfect secrecy, perfect omniscience and steiner tree packing. ISIT 2009: 1288-1292 | |
| c9 | ||
| c8 | Alexander Barg, Arya Mazumdar: On the number of errors correctable with codes on graphs. ISIT 2009: 2482-2486 | |
| i20 | N. Prasanth Anthapadmanabhan, Alexander Barg: Two-Level Fingerprinting Codes. CoRR abs/0905.0417 (2009) | |
| i19 | ||
| i18 | Alexander Barg, Arya Mazumdar: Codes in Permutations and Error Correction for Rank Modulation. CoRR abs/0908.4094 (2009) | |
| i17 | Alexander Barg, Arya Mazumdar: On the Number of Errors Correctable with Codes on Graphs. CoRR abs/0911.4522 (2009) | |
| 2008 | ||
| j38 | 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) | |
| j37 | 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) | |
| c7 | ||
| c6 | Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik: Secret key generation for a pairwise independent network model. ISIT 2008: 1015-1019 | |
| i16 | N. Prasanth Anthapadmanabhan, Alexander Barg: Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing. CoRR abs/0802.3419 (2008) | |
| i15 | ||
| i14 | Alexander Barg, Dmitry Yu. Nogin: A functional view of upper bounds on codes. CoRR abs/0809.0091 (2008) | |
| 2007 | ||
| i13 | Andrew Duggan, Alexander Barg: Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes. CoRR abs/cs/0701018 (2007) | |
| i12 | Alexander Barg, Punarbasu Purkayastha: Bounds on ordered codes and orthogonal arrays. CoRR abs/cs/0702033 (2007) | |
| 2006 | ||
| j36 | Alexander Barg, Dmitry Yu. Nogin: A bound on Grassmannian codes. J. Comb. Theory, Ser. A 113(8): 1629-1635 (2006) | |
| j35 | Alexander Barg, Gilles Zémor: Distance properties of expander codes. IEEE Transactions on Information Theory 52(1): 78-90 (2006) | |
| i11 | N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer: On the Fingerprinting Capacity Under the Marking Assumption. CoRR abs/cs/0612073 (2006) | |
| i10 | ||
| 2005 | ||
| j34 | Alexander Barg, Gilles Zémor: Concatenated codes: serial and parallel. IEEE Transactions on Information Theory 51(5): 1625-1634 (2005) | |
| j33 | 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) | |
| j32 | 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) | |
| r1 | Alexander Barg, Gregory A. Kabatiansky: Fingerprinting. Encyclopedia of Cryptography and Security 2005 | |
| i9 | ||
| i8 | ||
| i7 | Alexander Barg, Dmitry Yu. Nogin: Spectral approach to linear programming bounds on codes. CoRR abs/cs/0512025 (2005) | |
| 2004 | ||
| j31 | Alexander Barg, Gregory A. Kabatiansky: A class of I.P.P. codes with efficient identification. J. Complexity 20(2-3): 137-147 (2004) | |
| j30 | Alexander Barg, Gilles Zémor: Error Exponents of Expander Codes under Linear-Complexity Decoding. SIAM J. Discrete Math. 17(3): 426-445 (2004) | |
| j29 | 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) | |
| i6 | ||
| i5 | Alexander Barg: Improved error bounds for the erasure/list scheme: the binary and spherical cases. CoRR cs.IT/0407010 (2004) | |
| i4 | Alexander Barg, Andrew McGregor: Distance distribution of binary codes and the error probability of decoding. CoRR cs.IT/0407011 (2004) | |
| i3 | ||
| 2003 | ||
| j28 | 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 | ||
| j27 | Alexei E. Ashikhmin, Alexander Barg: Bounds on the Covering Radius of Linear Codes. Des. Codes Cryptography 27(3): 261-269 (2002) | |
| j26 | Alexander Barg: On Some Polynomials Related to Weight Enumerators of Linear Codes. SIAM J. Discrete Math. 15(2): 155-164 (2002) | |
| j25 | Alexander Barg, Gilles Zémor: Error exponents of expander codes. IEEE Transactions on Information Theory 48(6): 1725-1729 (2002) | |
| j24 | Alexander Barg, Dmitry Yu. Nogin: Bounds on packings of spheres in the Grassmann manifold. IEEE Transactions on Information Theory 48(9): 2450-2454 (2002) | |
| j23 | Alexander Barg, G. David Forney Jr.: Random codes: Minimum distances and error exponents. IEEE Transactions on Information Theory 48(9): 2568-2573 (2002) | |
| j22 | 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) | |
| 2001 | ||
| j21 | 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) | |
| j20 | 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) | |
| j19 | 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) | |
| j18 | 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) | |
| j17 | 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) | |
| j16 | 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) | |
| 2000 | ||
| j15 | 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) | |
| j14 | Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn: Quantum error detection II: Bounds. IEEE Transactions on Information Theory 46(3): 789-800 (2000) | |
| j13 | 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 | ||
| j12 | 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) | |
| j11 | Alexei E. Ashikhmin, Alexander Barg: Binomial Moments of the Distance Distribution: Bounds and Applications. IEEE Transactions on Information Theory 45(2): 438-452 (1999) | |
| j10 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn: New Upper Bounds on Generalized Weights. IEEE Transactions on Information Theory 45(4): 1258-1263 (1999) | |
| j9 | Alexander Barg, E. A. 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) | |
| j8 | Alexander Barg, Shiyu Zhou: Linear-time binary codes correcting localized erasures. IEEE Transactions on Information Theory 45(7): 2547-2552 (1999) | |
| i2 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn: Polynomial method in coding and information theory. CoRR math.CO/9910175 (1999) | |
| 1998 | ||
| j7 | Alexei E. Ashikhmin, Alexander Barg: Minimal Vectors in Linear Codes. IEEE Transactions on Information Theory 44(5): 2010-2017 (1998) | |
| 1997 | ||
| j6 | Alexander Barg: The Matroid of Supports of A Linear Code. Appl. Algebra Eng. Commun. Comput. 8(2): 165-172 (1997) | |
| j5 | Alexander Barg: A large family of sequences with low periodic correlation. Discrete Mathematics 176(1-3): 21-27 (1997) | |
| c5 | ||
| i1 | Alexander Barg: Complexity Issues in Coding Theory. Electronic Colloquium on Computational Complexity (ECCC) 4(46) (1997) | |
| 1996 | ||
| j4 | Alexander Barg: Two families of low-correlated binary sequences. Appl. Algebra Eng. Commun. Comput. 7(6): 433-437 (1996) | |
| 1995 | ||
| c4 | Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger: Variations on Minimal Codewords in Linear Codes. AAECC 1995: 96-105 | |
| c3 | 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 | |
| c2 | ||
| 1993 | ||
| j3 | Alexander Barg: Incomplete Sums, DC-Constrained Codes, and Codes that Maintain Synchronization. Des. Codes Cryptography 3(2): 105-116 (1993) | |
| 1992 | ||
| j2 | Alexander Barg, Ilya Dumer: On computing the weight spectrum of cyclic codes. IEEE Transactions on Information Theory 38(4): 1382-1386 (1992) | |
| 1991 | ||
| j1 | Alexander Barg, Simon Litsyn: DC-constrained codes from Hadamard matrices. IEEE Transactions on Information Theory 37(3): 801-807 (1991) | |
| c1 | Alexander Barg: Exponential Sums and Constrained Error-Correcting Codes. Algebraic Coding 1991: 16-22 | |
Colors in the list of coauthors
Last update Sat May 25 13:35:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page