The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Barg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  51. Spectral approach to linear programming bounds on codes [Citation Graph (, )][DBLP]


  52. A bound on Grassmannian codes [Citation Graph (, )][DBLP]


  53. Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing [Citation Graph (, )][DBLP]


  54. Codes on hypergraphs [Citation Graph (, )][DBLP]


  55. A functional view of upper bounds on codes [Citation Graph (, )][DBLP]


  56. Two-Level Fingerprinting Codes [Citation Graph (, )][DBLP]


  57. Bounds on sets with few distances [Citation Graph (, )][DBLP]


  58. Codes in Permutations and Error Correction for Rank Modulation [Citation Graph (, )][DBLP]


  59. On the Number of Errors Correctable with Codes on Graphs [Citation Graph (, )][DBLP]


  60. Secret Key Generation for a Pairwise Independent Network Model [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002