The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexei E. Ashikhmin: [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. Victor V. Zyablov, Alexei E. Ashikhmin
    Partial Unit Memory Codes on the Base of Subcodes of Hadamard Codes. [Citation Graph (0, 0)][DBLP]
    Error Control, Cryptology, and Speech Compression, 1993, pp:69-73 [Conf]
  3. Alexei E. Ashikhmin, Simon Litsyn
    A Fast Search for the Maximum Element of the Fourier Spectrum. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:134-141 [Conf]
  4. Alexei E. Ashikhmin, Alexander Barg
    Minimal Supports in Linear Codes. [Citation Graph (0, 0)][DBLP]
    IMA Conf., 1995, pp:13- [Conf]
  5. Alexei E. Ashikhmin, Simon Litsyn
    Fast Decoding of Non-Binary First Order Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:4, pp:299-308 [Journal]
  6. 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]
  7. Alexei E. Ashikhmin
    On Generalized Hamming Weights for Galois Ring Linear Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:2, pp:107-126 [Journal]
  8. 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]
  9. Alexei E. Ashikhmin, Simon Litsyn
    Fast Decoding Algorithms for First Order Reed-Muller and Related Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:7, n:3, pp:187-214 [Journal]
  10. 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]
  11. Juriaan Simonis, Alexei E. Ashikhmin
    Almost Affine Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:2, pp:179-197 [Journal]
  12. 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]
  13. Stephan ten Brink, Gerhard Kramer, Alexei E. Ashikhmin
    Design of low-density parity-check codes for modulation and detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2004, v:52, n:4, pp:670-678 [Journal]
  14. Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
    Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:7, pp:1349-1349 [Journal]
  15. Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
    EXIT Functions for Binary Input Memoryless Symmetric Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:7, pp:1207-1214 [Journal]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Bounds on distance distributions in codes of known size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:250-258 [Journal]
  24. Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On relations between covering radius and dual distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1808-1816 [Journal]
  25. Alexei E. Ashikhmin, Emanuel Knill
    Nonbinary quantum stabilizer codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3065-3072 [Journal]
  26. Alexei E. Ashikhmin, Gerhard Kramer, Stephan ten Brink
    Extrinsic information transfer functions: model and erasure channel properties. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2657-2673 [Journal]
  27. Alexei E. Ashikhmin, Simon Litsyn
    Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:8, pp:1812-1818 [Journal]
  28. Alexei E. Ashikhmin, Simon Litsyn
    Upper Bounds on the Size of Quantum Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1206-1215 [Journal]
  29. Alexei E. Ashikhmin, Vitaly Skachek
    Decoding of Expander Codes at Rates Close to Capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:12, pp:5475-5485 [Journal]
  30. Jubin Jose, Alexei E. Ashikhmin, Phil Whiting, Sriram Vishwanath
    Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  31. DSL Crosstalk Coefficient Acquisition Using SNR Feedback. [Citation Graph (, )][DBLP]


  32. Design and development of a terrestrial digital video broadcast demodulation core: An international collaborative effort. [Citation Graph (, )][DBLP]


  33. Performance results for digital subscriber line precoders. [Citation Graph (, )][DBLP]


  34. Decoding of Expander Codes at Rates Close to Capacity [Citation Graph (, )][DBLP]


  35. Scheduling and Precoding in Multi-User Multiple Antenna Time Division Duplex Systems [Citation Graph (, )][DBLP]


  36. Pilot Contamination Problem in Multi-Cell TDD Systems [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002