The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vitaly Skachek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vitaly Skachek, Tuvi Etzion, Ron M. Roth
    Efficient Encoding Algorithm for Third-Order Spectral-Null Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:846-851 [Journal]
  2. 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]
  3. Ron M. Roth, Vitaly Skachek
    Improved Nearly-MDS Expander Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3650-3661 [Journal]
  4. Ron M. Roth, Vitaly Skachek
    Improved Nearly-MDS Expander Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  5. Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath
    Linear-programming Decoding of Non-binary Linear Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

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


  7. Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes [Citation Graph (, )][DBLP]


  8. Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN [Citation Graph (, )][DBLP]


  9. Linear-Programming Decoding of Nonbinary Linear Codes [Citation Graph (, )][DBLP]


  10. Recursive Code Construction for Random Networks [Citation Graph (, )][DBLP]


  11. Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming [Citation Graph (, )][DBLP]


  12. On the Pseudocodeword Redundancy [Citation Graph (, )][DBLP]


  13. Exploration of AWGNC and BSC Pseudocodeword Redundancy [Citation Graph (, )][DBLP]


  14. Characterization of Graph-cover Pseudocodewords of Codes over $F_3$ [Citation Graph (, )][DBLP]


  15. Probabilistic algorithm for finding roots of linearized polynomials. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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