List of Publications

Quasioptimal Biorthogonal-Code Decoding Algorithms
A. Ashikhmin and S. Litsyn, Radioelectronica, vol. 31, no. 11, pp. 30-34, 1988 (in Russian).
English translation: Radioelectronics and Communications Systems, vol. 31, no. 11, pp. 26-30, 1988.

A List Algorithm for Locating the Maximal Element in a Walsh Spectrum
A. Ashikhmin and S. Litsyn, Radioelectronica, vol. 33, no. 3, pp. 39-43, 1990 (in Russian).
English Translation: Radioelectronics and Communications Systems, vol. 33, no. 3, pp. 37-41, 1990.

A Fast Search for the Maximum Element of the Fourier Spectrum
A. Ashikhmin and S. Litsyn in: Algebraic Coding. Lecture Notes in Computer Science, no. 573, pp. 134-141, 1991.

Partial Unit Memory Codes on the Base of Subcodes of Hadamard Codes
A. Ashikhmin and V. Zyablov in: Advances in Error Control, Cryptology, and Speech Compression. Lecture Notes in Computer Science, no. 829, pp. 69-73, 1994.

Samples of Unit-Memory Codes Over Z_4
A. Ashikhmin and V. Zyablov in: Proc. 1994 IEEE International Workshop on Information Theory Moscow, Russia, pp. 119-121, 1994.

Variations on Minimal Codewords in Linear Codes
A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, Lecture Notes in Computer Science, no. 948, Springer Verlag, pp.96-105, 1995.

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes
A. Ashikhmin and S. Litsyn, Designs, Codes and Cryptography, vol. 7, no. 3, pp.187-215, 1996.

Fast Decoding of Nonbinary Orthogonal Codes
A. Ashikhmin and S. Litsyn, Applicable Algebra in Engineering, Communication, and Computing, no. 4, pp.299-308, 1996.

Almost Affine Codes
J. Simonis and A. Ashikhmin, Designs, Codes and Cryptography, vol.14, no.2, pp.179-197, 1998.
Also REPORT 96-22, the Faculty of Technical Mathematics and Informatics, Delft University of Technology, ISSN 0922-5641.

Generalized Hamming Weights of Galois Ring Linear Codes
A. Ashikhmin, Designs, Codes and Cryptography, vol 14. no.2, pp.107-127, 1998.

On Delsarte Inequalities
A. Ashikhmin and J. Simonis, Linear Algebra and its Applications, vol. 269, pp. 197-217, 1998.
Also REPORT 96-87, the Faculty of Technical Mathematics and Informatics, Delft University of Technology, ISSN 0922-5641.

Minimal Vectors in Linear Codes
A. Ashikhmin and A. Barg, IEEE Trans. on Inf. Theory, Sept, no. 5, pp. 2010-2018, 1998 . Also Bielefeld, SFB 343 Diskrete Strukturen in der Mathematik, preprint 94-113, 1994, available online at
http://www.mathematik.uni-bielefeld.de/sfb343/preprints.

Binomial Moments of the Distance Distribution and the Probability of Undetected Error
A. Ashikhmin and A. Barg, Designs, Codes and Cryptography, vol.16, no. 2, pp.103-116, 1999.

Binomial Moments of the Distance Distribution: Bounds and Applications
A. Ashikhmin and A. Barg, IEEE Trans. on Inf. Theory, March, no. 2, pp. 438-453, 1999.

Upper Bounds on the Size of Quantum Codes
A. Ashikhmin and S. Litsyn, IEEE Trans. on Inf. Theory, May, no. 4, pp. 1206-1216, 1999.

New Upper Bounds on Generalized Weights
A. Ashikhmin, A. Barg, and S. Litsyn, IEEE Trans. Inform.Theory, May, no. 4, pp. 1258-1263, 1999.

On Relations Between Covering Radius and Dual Distance
A. Ashikhmin, I. Honkala, T. Laihonen, and S. Litsyn, IEEE Trans. Inform.Theory, to appear.

A New Upper Bound on Codes Decodable into Size-2 Lists
A. Ashikhmin, A. Barg, and S. Litsyn, DIMACS report 99-05. Numbers, Information and Complexity, submitted.

A New Upper Bound on the Reliability Function of the Gaussian Channel
A. Ashikhmin, A. Barg, and S. Litsyn, DIMACS report pp. 99-06. IEEE Trans. Inform.Theory, submitted (2 Feb. 99).

Quantum Error Detection I: Statement of the Problem
A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn. Trans. Inform.Theory, submitted.

Quantum Error Detection II: Lower and Upper Bounds
A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn. Trans. Inform.Theory, submitted.

Return to:
Alexei Ashikhmin's Home Page