 | 2009 |
| 12 |  | Vitaly Skachek:
Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming
CoRR abs/0906.1565: (2009) |
| 2008 |
| 11 |  | Vitaly Skachek,
Mark F. Flanagan:
Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN
CoRR abs/0803.3777: (2008) |
| 10 |  | Mark F. Flanagan,
Vitaly Skachek,
Eimear Byrne,
Marcus Greferath:
Linear-Programming Decoding of Nonbinary Linear Codes
CoRR abs/0804.4384: (2008) |
| 9 |  | Vitaly Skachek:
Recursive Code Construction for Random Networks
CoRR abs/0806.3650: (2008) |
| 8 |  | Vitaly Skachek,
Ron M. Roth:
Probabilistic algorithm for finding roots of linearized polynomials.
Des. Codes Cryptography 46(1): 17-23 (2008) |
| 2007 |
| 7 |  | Mark F. Flanagan,
Vitaly Skachek,
Eimear Byrne,
Marcus Greferath:
Linear-programming Decoding of Non-binary Linear Codes
CoRR abs/0707.4360: (2007) |
| 6 |  | Vitaly Skachek,
Mark F. Flanagan,
Eimear Byrne,
Marcus Greferath:
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes
CoRR abs/0712.4075: (2007) |
| 2006 |
| 5 |  | Ron M. Roth,
Vitaly Skachek:
Improved Nearly-MDS Expander Codes
CoRR abs/cs/0601090: (2006) |
| 4 |  | Alexei E. Ashikhmin,
Vitaly Skachek:
Decoding of Expander Codes at Rates Close to Capacity.
IEEE Transactions on Information Theory 52(12): 5475-5485 (2006) |
| 3 |  | Ron M. Roth,
Vitaly Skachek:
Improved Nearly-MDS Expander Codes.
IEEE Transactions on Information Theory 52(8): 3650-3661 (2006) |
| 2005 |
| 2 |  | Alexei E. Ashikhmin,
Vitaly Skachek:
Decoding of Expander Codes at Rates Close to Capacity
CoRR abs/cs/0508062: (2005) |
| 1998 |
| 1 |  | Vitaly Skachek,
Tuvi Etzion,
Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
IEEE Transactions on Information Theory 44(2): 846-851 (1998) |