Topics
LiaoPlace
Two counting arguments are used to derive a system of linear inequalities which give rise to an upperbound on the size of a code for a 2-access binary erasure channel.\u3cbr/\u3e\u3cbr/\u3eFor uniquely decodable codes this bound reduces to a purely combinatorial proof of a result by Liao. Examples of this bound are given for some codes with minimum distance 4
Abstract — We derive simple lower bounds on the number of iterations which are required to communica...
Abstract—It is now well known that the performance of a linear code under iterative decoding on a bi...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Two counting arguments are used to derive a system of linear inequalities which give rise to an uppe...
A method for determining an upper bound for the size of a code for a two-access binary erasure chann...
An algebraic and a combinatorial upper bound are derived on |C2| given the code C1, where(Cl, C2) is...
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures....
An explicit construction is presented of uniquely decodable code pairs for the two-access binary era...
Dedicated to Prof. R. Ahlswede on the occasion of his 60-th birthday Abstract: A new asymptotic uppe...
Most decoding algorithms of linear codes, in general, are designed to correct or detect errors. Howe...
Using earlier methods a combinatorial upper bound is derived for|C|. cdot |D|, where(C,D)is adelta-d...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
Abstract. This paper presents essentially optimal lower bounds on the size of linear codes C: {0, 1}...
Abstract — We derive simple lower bounds on the number of iterations which are required to communica...
Abstract—It is now well known that the performance of a linear code under iterative decoding on a bi...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Two counting arguments are used to derive a system of linear inequalities which give rise to an uppe...
A method for determining an upper bound for the size of a code for a two-access binary erasure chann...
An algebraic and a combinatorial upper bound are derived on |C2| given the code C1, where(Cl, C2) is...
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures....
An explicit construction is presented of uniquely decodable code pairs for the two-access binary era...
Dedicated to Prof. R. Ahlswede on the occasion of his 60-th birthday Abstract: A new asymptotic uppe...
Most decoding algorithms of linear codes, in general, are designed to correct or detect errors. Howe...
Using earlier methods a combinatorial upper bound is derived for|C|. cdot |D|, where(C,D)is adelta-d...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
Abstract. This paper presents essentially optimal lower bounds on the size of linear codes C: {0, 1}...
Abstract — We derive simple lower bounds on the number of iterations which are required to communica...
Abstract—It is now well known that the performance of a linear code under iterative decoding on a bi...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Add to ORKG