Simon Litsyn

According to our database, Simon Litsyn authored at least 145 papers between 1986 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2017

Recursive descriptions of polar codes.

Noam Presman, Simon Litsyn

Adv. Math. Commun., 2017

2016

Mixed-Kernels Constructions of Polar Codes.

Noam Presman, Ofer Shapira, Simon Litsyn

IEEE J. Sel. Areas Commun., 2016

2015

Binary Polarization Kernels From Code Decompositions.

Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy

IEEE Trans. Inf. Theory, 2015

2013

The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem.

Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No

IEEE Signal Process. Mag., 2013

Design of non-binary quasi-cyclic LDPC codes by ACE optimization.

Alex Bazarsky, Noam Presman, Simon Litsyn

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Polar codes.

Simon Litsyn

Proceedings of the Handbook of Finite Fields., 2013

2012

An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals.

Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn

IEEE Trans. Commun., 2012

A model for OFDM signals with applications.

Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn

Trans. Emerg. Telecommun. Technol., 2012

Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes

Noam Presman, Simon Litsyn

CoRR, 2012

2011

Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem.

Gerhard Wunder, Robert F. H. Fischer, Simon Litsyn, Jong-Seon No

EURASIP J. Adv. Signal Process., 2011

On the EVM computation of arbitrary clipped multi-carrier signals.

Igal Kotzer, Simon Litsyn

EURASIP J. Adv. Signal Process., 2011

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.

Vladimir M. Blinovsky, Simon Litsyn

Discret. Comput. Geom., 2011

Binary polar code kernels from code decompositions.

Noam Presman, Ofer Shapira, Simon Litsyn

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Polar codes with mixed kernels.

Noam Presman, Ofer Shapira, Simon Litsyn

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the EVM of sequences.

Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Symbol-pair codes: Algebraic constructions and asymptotic bounds.

Yuval Cassuto, Simon Litsyn

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Typical peak sidelobe level of binary sequences.

Noga Alon, Simon Litsyn, Alexander Shpunt

IEEE Trans. Inf. Theory, 2010

Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2).

Tali Kaufman, Simon Litsyn, Ning Xie

SIAM J. Comput., 2010

Weight distribution moments of random linear/coset codes.

Vladimir M. Blinovsky, Uri Erez, Simon Litsyn

Des. Codes Cryptogr., 2010

2009

Convergence analysis of generalized serial message-passing schedules.

Eran Sharon, Noam Presman, Simon Litsyn

IEEE J. Sel. Areas Commun., 2009

Analysis of LDPC decoding schedules.

Eran Sharon, Noam Presman, Simon Litsyn

Proceedings of the IEEE International Symposium on Information Theory, 2009

Decreasing error floor in LDPC codes by parity-check matrix extensions.

Eran Sharon, Omer Fainzilber, Simon Litsyn

Proceedings of the IEEE International Symposium on Information Theory, 2009

New asymptotic bounds on the size of list codes on Euclidean sphere.

Vladimir M. Blinovsky, Simon Litsyn

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Improved Upper Bounds on the Reliability Function of the Gaussian Channel.

Yael Ben-Haim, Simon Litsyn

IEEE Trans. Inf. Theory, 2008

Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.

Christine Bachoc, Yael Ben-Haim, Simon Litsyn

IEEE Trans. Inf. Theory, 2008

Constructing LDPC codes by error minimization progressive edge growth.

Eran Sharon, Simon Litsyn

IEEE Trans. Commun., 2008

On the Distribution of Boolean Function Nonlinearity.

Simon Litsyn, Alexander Shpunt

SIAM J. Discret. Math., 2008

On PMEPR of algebraic codes.

Idan Alrod, Simon Litsyn, Alexander A. Yudin

Eur. Trans. Telecommun., 2008

Efficient layers-based schedules for iterative decoding of LDPC codes.

Noam Presman, Eran Sharon, Simon Litsyn

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Typical peak sidelobe level of binary sequences.

Simon Litsyn, Alexander Shpunt

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Efficient Serial Message-Passing Schedules for LDPC Decoding.

Eran Sharon, Simon Litsyn, Jacob Goldberger

IEEE Trans. Inf. Theory, 2007

Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.

Shay Freundlich, David Burshtein, Simon Litsyn

IEEE Trans. Inf. Theory, 2007

A Balancing Method for PMEPR Reduction in OFDM Signals.

Simon Litsyn, Alexander Shpunt

IEEE Trans. Commun., 2007

Lazy scheduling forLDPC decoding.

Daniel Levin, Eran Sharon, Simon Litsyn

IEEE Commun. Lett., 2007

Breaking the ε-Soundness Bound of the Linearity Test over GF(2).

Tali Kaufman, Simon Litsyn, Ning Xie

Electron. Colloquium Comput. Complex., 2007

Improved lower bounds on sizes of single-error correcting codes.

Simon Litsyn, Beniamin Mounits

Des. Codes Cryptogr., 2007

New upper bounds on codes via association schemes and linear programming.

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

Adv. Math. Commun., 2007

A new upper bound on the rate of non-binary codes.

Yael Ben-Haim, Simon Litsyn

Adv. Math. Commun., 2007

Bounds for Codes in the Grassmann Manifold.

Christine Bachoc, Yael Ben-Haim, Simon Litsyn

Proceedings of the IEEE International Symposium on Information Theory, 2007

Peak power control in multicarrier communications.

Simon Litsyn

Cambridge University Press, ISBN: 978-0-521-85596-9, 2007

2006

Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.

Simon Litsyn, Gerhard Wunder

IEEE Trans. Inf. Theory, 2006

Improved Upper Bounds for Codes With Unequal Error Protection.

Shraga I. Bross, Simon Litsyn

IEEE Trans. Inf. Theory, 2006

Upper bounds on the rate of LDPC codes as a function of minimum distance.

Yael Ben-Haim, Simon Litsyn

IEEE Trans. Inf. Theory, 2006

Analysis of low-density parity-check codes based on EXIT functions.

Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn

IEEE Trans. Commun., 2006

EXIT Functions for Binary Input Memoryless Symmetric Channels.

Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn

IEEE Trans. Commun., 2006

Improved decoding of LDPC coded modulations.

Yaniv Nana, Eran Sharon, Simon Litsyn

IEEE Commun. Lett., 2006

On the peak-to-average power ratio of M-sequences.

Idan Alrod, Simon Litsyn, Alexander A. Yudin

Finite Fields Their Appl., 2006

A Method for Constructing LDPC Codes with Low Error Floor.

Eran Sharon, Simon Litsyn

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity.

Shay Freundlich, David Burshtein, Simon Litsyn

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Long Extended BCH Codes Are Spanned by Minimum Weight Words.

Tali Kaufman, Simon Litsyn

Proceedings of the Applied Algebra, 2006

2005

Discrete and continuous maxima in multicarrier communication.

Simon Litsyn, Alexander A. Yudin

IEEE Trans. Inf. Theory, 2005

Lattices which are good for (almost) everything.

Uri Erez, Simon Litsyn, Ram Zamir

IEEE Trans. Inf. Theory, 2005

Bounds on distance distributions in codes of known size.

Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn

IEEE Trans. Inf. Theory, 2005

Testing Reed-Muller codes.

Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron

IEEE Trans. Inf. Theory, 2005

Exact Minimum Density of Codes Identifying Vertices in the Square Grid.

Yael Ben-Haim, Simon Litsyn

SIAM J. Discret. Math., 2005

New upper bounds on A(n, d).

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Almost Orthogonal Linear Codes are Locally Testable.

Tali Kaufman, Simon Litsyn

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Covering Codes.

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein

North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005

2004

Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes.

Alexei E. Ashikhmin, Simon Litsyn

IEEE Trans. Inf. Theory, 2004

A method to suppress high peaks in BPSK-modulated OFDM signal.

Gregory Freiman, Simon Litsyn, Alexander A. Yudin

IEEE Trans. Commun., 2004

EXIT functions for binary memoryless symmetric channels.

Eran Sharon, Alexei Ashikhmin, Simon Litsyn

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On signals with very high peak-to-average power ratio.

Gregory Freiman, Simon Litsyn, Alexander A. Yudin

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Distance distributions in ensembles of irregular low-density parity-check codes.

Simon Litsyn, Vladimir Shevelev

IEEE Trans. Inf. Theory, 2003

Generalized hashing and parent-identifying codes.

Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn

J. Comb. Theory, Ser. A, 2003

A Coding Theory Bound and Zero-Sum Square Matrices.

Noga Alon, Simon Litsyn, Raphael Yuster

Graphs Comb., 2003

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.

Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn

Discret. Appl. Math., 2003

Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83].

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun

Discret. Appl. Math., 2003

Intersecting Codes and Separating Codes.

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun

Discret. Appl. Math., 2003

Testing Low-Degree Polynomials over GF(2(.

Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron

Proceedings of the Approximation, 2003

On the statistical distribution of the crest-factor of codes in OFDM transmission.

Gerhard Wunder, Simon Litsyn

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

On the capacity of two-dimensional weight-constrained memories.

Simon Litsyn, Alexander Shpunt

Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002

Improved upper bounds on sizes of codes.

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

IEEE Trans. Inf. Theory, 2002

On ensembles of low-density parity-check codes: Asymptotic distance distributions.

Simon Litsyn, Vladimir Shevelev

IEEE Trans. Inf. Theory, 2002

Upper bounds on the rate of LDPC Codes.

David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller

IEEE Trans. Inf. Theory, 2002

2001

A Z₈-linear lift of the binary Golay code and a nonlinear Binary (96, 2³⁷, 24)-code.

Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt

IEEE Trans. Inf. Theory, 2001

Binary B₂-Sequences : A New Upper Bound.

Gérard D. Cohen, Simon Litsyn, Gilles Zémor

J. Comb. Theory, Ser. A, 2001

Intersecting codes and partially identifying codes.

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn

Electron. Notes Discret. Math., 2001

Estimates of the Distance Distribution of Codes and Designs.

Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn

Electron. Notes Discret. Math., 2001

Bounds on identifying codes.

Uri Blass, Iiro S. Honkala, Simon Litsyn

Discret. Math., 2001

On the Distance Distributions of BCH Codes and Their Duals.

Ilia Krasikov, Simon Litsyn

Des. Codes Cryptogr., 2001

Binary Codes for Collusion-Secure Fingerprinting.

Gérard D. Cohen, Simon Litsyn, Gilles Zémor

Proceedings of the Information Security and Cryptology, 2001

On the Identification of Vertices and Edges Using Cycles.

Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn

Proceedings of the Applied Algebra, 2001

2000

An improved upper bound on the minimum distance of doubly-even self-dual codes.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 2000

A new upper bound on the reliability function of the Gaussian channel.

Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn

IEEE Trans. Inf. Theory, 2000

Quantum error detection II: Bounds.

Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn

IEEE Trans. Inf. Theory, 2000

Quantum error detection I: Statement of the problem.

Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn

IEEE Trans. Inf. Theory, 2000

1999

New Upper Bounds on Error Exponents.

Simon Litsyn

IEEE Trans. Inf. Theory, 1999

On the Distance Distribution of Duals of BCH Codes.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

More on the Distance Distribution of BCH Codes.

Osnat Keren, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

Asymptotically exact bounds on the size of high-order spectral-null codes.

Gregory Freiman, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

On binary constructions of quantum codes.

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

Upper Bounds on the Size of Quantum Codes.

Alexei E. Ashikhmin, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

On relations between covering radius and dual distance.

Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

New Upper Bounds on Generalized Weights.

Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn

IEEE Trans. Inf. Theory, 1999

New Bounds On Covering Radius as a Function of Dual Distance.

Tero Laihonen, Simon Litsyn

SIAM J. Discret. Math., 1999

Polynomial method in coding and information theory

Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn

CoRR, 1999

The smallest covering code of length 8 and radius 2 has 12 words.

Uri Blass, Simon Litsyn

Ars Comb., 1999

Survey of binary Krawtchouk polynomials.

Ilia Krasikov, Simon Litsyn

Proceedings of the Codes and Association Schemes, 1999

Estimates of the distance distribution of nonbinary codes, with applications.

Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn

Proceedings of the Codes and Association Schemes, 1999

On tHe Size of Identifying Codes.

Uri Blass, Iiro S. Honkala, Simon Litsyn

Proceedings of the Applied Algebra, 1999

1998

Codes Correcting Phased Burst Erasures.

Osnat Keren, Simon Litsyn

IEEE Trans. Inf. Theory, 1998

Several New Lower Bounds on the Size of Codes with Covering Radius One.

Uri Blass, Simon Litsyn

IEEE Trans. Inf. Theory, 1998

On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.

Tero Laihonen, Simon Litsyn

Des. Codes Cryptogr., 1998

Bounds on Spectra of Codes with Known Dual Distance.

Ilia Krasikov, Simon Litsyn

Des. Codes Cryptogr., 1998

On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.

Simon Litsyn, Patrick Solé, René Struik

Discret. Appl. Math., 1998

Several new lower bounds for football pool systems.

Uri Blass, Simon Litsyn

Ars Comb., 1998

1997

Parameters of Goppa codes revisited.

Françoise Levy-dit-Vehel, Simon Litsyn

IEEE Trans. Inf. Theory, 1997

Linear programming bounds for doubly-even self-dual codes.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 1997

Estimates for the range of binomiality in codes' spectra.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 1997

A class of array codes correcting multiple column erasures.

Osnat Keren, Simon Litsyn

IEEE Trans. Inf. Theory, 1997

Long packing and covering codes.

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé

IEEE Trans. Inf. Theory, 1997

Tiling Hamming Space with Few Spheres.

Henk D. L. Hollmann, János Körner, Simon Litsyn

J. Comb. Theory, Ser. A, 1997

Linear Programming Bounds for Codes of Small Size.

Ilia Krasikov, Simon Litsyn

Eur. J. Comb., 1997

On Covering Radius and Discrete Chebyshev Polynomials.

Iiro S. Honkala, Tero Laihonen, Simon Litsyn

Appl. Algebra Eng. Commun. Comput., 1997

Covering Radius 1985-1994.

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.

Appl. Algebra Eng. Commun. Comput., 1997

1996

More on the covering radius of BCH codes.

Françoise Levy-dit-Vehel, Simon Litsyn

IEEE Trans. Inf. Theory, 1996

On greedy algorithms in coding theory.

Gérard D. Cohen, Simon Litsyn, Gilles Zémor

IEEE Trans. Inf. Theory, 1996

On the traveling salesman problem in binary Hamming spaces.

Gérard D. Cohen, Simon Litsyn, Gilles Zémor

IEEE Trans. Inf. Theory, 1996

Tilings of Binary Spaces.

Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor

SIAM J. Discret. Math., 1996

On Integral Zeros of Krawtchouk Polynomials.

Ilia Krasikov, Simon Litsyn

J. Comb. Theory, Ser. A, 1996

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance.

Simon Litsyn, Aimo Tietäväinen

Eur. J. Comb., 1996

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes.

Alexei E. Ashikhmin, Simon Litsyn

Des. Codes Cryptogr., 1996

Fast decoding of non-binary first order Reed-Muller codes.

Alexei E. Ashikhmin, Simon Litsyn

Appl. Algebra Eng. Commun. Comput., 1996

1995

On the accuracy of the binomial approximation to the distance distribution of codes.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 1995

On spectra of BCH codes.

Ilia Krasikov, Simon Litsyn

IEEE Trans. Inf. Theory, 1995

Weighted coverings and packings.

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.

IEEE Trans. Inf. Theory, 1995

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.

Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård

SIAM J. Discret. Math., 1995

Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.

Yaron Klein, Simon Litsyn, Alexander Vardy

Des. Codes Cryptogr., 1995

On the Covering Radius of Long Goppa Codes.

Françoise Levy-dit-Vehel, Simon Litsyn

Proceedings of the Applied Algebra, 1995

On Algebraic Methods in Covering Radius Problems.

Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen

Proceedings of the Applied Algebra, 1995

1994

The uniqueness of the Best code.

Simon Litsyn, Alexander Vardy

IEEE Trans. Inf. Theory, 1994

Upper bounds on generalized distances.

Gérard D. Cohen, Simon Litsyn, Gilles Zémor

IEEE Trans. Inf. Theory, 1994

Character Sum Constructions of Constrained Error-Correcting Codes.

Simon Litsyn, Aimo Tietäväinen

Appl. Algebra Eng. Commun. Comput., 1994

Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables.

Simon Litsyn, Oscar Moreno, Carlos J. Moreno

Appl. Algebra Eng. Commun. Comput., 1994

1993

Error-correcting codes with bounded running digital sum.

Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1993

Bounds for Binary Multiple Covering Codes.

Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn

Des. Codes Cryptogr., 1993

Two new upper bounds for codes of distance 3.

Simon Litsyn, Alexander Vardy

Proceedings of the Algebraic Coding, 1993

1992

On the covering radius of Reed-Muller codes.

Gérard D. Cohen, Simon Litsyn

Discret. Math., 1992

1991

A note on perfect multiple covetings of the Hamming space.

Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn

IEEE Trans. Inf. Theory, 1991

DC-constrained error-correcting codes with small running digital sum.

Gérard D. Cohen, Simon Litsyn

IEEE Trans. Inf. Theory, 1991

DC-constrained codes from Hadamard matrices.

Alexander Barg, Simon Litsyn

IEEE Trans. Inf. Theory, 1991

On Perfect Weighted Coverings with Small Radius.

Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.

Proceedings of the Algebraic Coding, 1991

A Fast Search for the Maximum Element of the Fourier Spectrum.

Alexei E. Ashikhmin, Simon Litsyn

Proceedings of the Algebraic Coding, 1991

Fast Algorithms for Decoding Orthogonal and Related Codes.

Simon Litsyn

Proceedings of the Applied Algebra, 1991

1986

A note on lower bounds.

Simon Litsyn, Michael A. Tsfasman

IEEE Trans. Inf. Theory, 1986