A direct geometrical method for bounding the error exponent for any specific family of channel codes. I. Cutoff rate lower bound for block codes
DE Lazic, V Senk - IEEE transactions on information theory, 1992 - ieeexplore.ieee.org
A direct, general, and conceptually simple geometrical method for determining lower and
upper bounds on the error exponent of any specific family of channel block codes is …
upper bounds on the error exponent of any specific family of channel block codes is …
Bounds on spectra of codes with known dual distance
I Krasikov, S Litsyn - Designs, Codes and Cryptography, 1998 - Springer
We estimate the interval where the distance distribution of a code of length n and of given
dual distance is upperbounded by the binomial distribution. The binomial upper bound is …
dual distance is upperbounded by the binomial distribution. The binomial upper bound is …
Bounds for the weight distribution of weakly self-dual codes
VP Roychowdhury, F Vatan - IEEE Transactions on Information …, 2001 - ieeexplore.ieee.org
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get
these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert …
these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert …
Which families of long binary linear codes have a binomial weight distribution?
T Beth, H Kalouti, DE Lazic - … Algorithms and Error-Correcting Codes: 11th …, 1995 - Springer
In this paper, primitive binary BCH-codes and two linear binary code families based on
Hadamard matrices are considered. A review of all results concerning bounds on weight …
Hadamard matrices are considered. A review of all results concerning bounds on weight …
Spectra of long primitive binary BCH codes cannot approach the binomial distribution
DE Lazic, H Kalouti, T Beth - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
Usually spectra (weight distributions) of primitive binary BCH codes are supposed to
approximate binomial weight distributions well for a wide range of code rates and code …
approximate binomial weight distributions well for a wide range of code rates and code …
Weight distributions of binary linear codes based on Hadamard matrices
T Beth, H Kalouti, DE Lazic - Proceedings of 1994 IEEE …, 1994 - ieeexplore.ieee.org
Sequences of constant rate binary linear codes derived from Hadamard matrices are
considered and the weight distributions of these codes up to size (104, 52) are given. They …
considered and the weight distributions of these codes up to size (104, 52) are given. They …
Weights of long primitive binary BCH-codes are not binomially distributed
DE Lazic, H Kalouti, T Beth - Proceedings of 1995 IEEE …, 1995 - ieeexplore.ieee.org
Weights of long primitive binary BCH-codes are not binomially distributed Page 1 Weights of
Long Primitive Binary BCH-Codes Are Not Binomially Dejan E. Lazic, Bakam Kalouti, Thomas …
Long Primitive Binary BCH-Codes Are Not Binomially Dejan E. Lazic, Bakam Kalouti, Thomas …
Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels
P Wocjan, DE Lazic, T Beth - arXiv preprint quant-ph/0007051, 2000 - arxiv.org
A conceptually simple method for derivation of lower bounds on the error exponent of
specific families of block codes used on classical-quantum channels with arbitrary signal …
specific families of block codes used on classical-quantum channels with arbitrary signal …