<p>Properties of barcode sets with fixed experimental constraints. The average () and the maximum error () are obtained over a non-symmetric channel defined in the <i>Channel Model</i> part.</p
A well-know result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varyin...
We examine new low rate error upper bounds for M equally likely code words used over discrete input ...
We propose an approach to Longobardi’s parametric comparison method (PCM) via the theory of error-co...
<p>BY barcodes of size <i>N</i> over a <i>QSC</i> model where mismatch errors occur with probability...
<p>Random barcodes of size <i>N</i> with minimum edit distance [<a href="http://www.plosone.org/arti...
<p>LDPC barcodes of size <i>N</i> ≤ 25 constrained to accomplish <i>M</i> ≥ 24 and <i>p</i><sub><i>u...
<p>BCH barcodes of size <i>N</i> ≤ 25 constrained to accomplish <i>M</i> ≥ 24 and <i>p</i><sub><i>u<...
The block error probability under maximum likelihood decoding of general linear block codes and code...
We introduce two notions of discrepancy between binary vectors, which are not metric functions in ge...
Graduation date: 2010A relatively new model of error control is the limited magnitude error over hig...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A new analysis technique is suggested for bounding the error probability of fixed length block codes...
Abstract-A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitra...
Ahlswede R. Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift...
A well-know result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varyin...
We examine new low rate error upper bounds for M equally likely code words used over discrete input ...
We propose an approach to Longobardi’s parametric comparison method (PCM) via the theory of error-co...
<p>BY barcodes of size <i>N</i> over a <i>QSC</i> model where mismatch errors occur with probability...
<p>Random barcodes of size <i>N</i> with minimum edit distance [<a href="http://www.plosone.org/arti...
<p>LDPC barcodes of size <i>N</i> ≤ 25 constrained to accomplish <i>M</i> ≥ 24 and <i>p</i><sub><i>u...
<p>BCH barcodes of size <i>N</i> ≤ 25 constrained to accomplish <i>M</i> ≥ 24 and <i>p</i><sub><i>u<...
The block error probability under maximum likelihood decoding of general linear block codes and code...
We introduce two notions of discrepancy between binary vectors, which are not metric functions in ge...
Graduation date: 2010A relatively new model of error control is the limited magnitude error over hig...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A new analysis technique is suggested for bounding the error probability of fixed length block codes...
Abstract-A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitra...
Ahlswede R. Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift...
A well-know result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varyin...
We examine new low rate error upper bounds for M equally likely code words used over discrete input ...
We propose an approach to Longobardi’s parametric comparison method (PCM) via the theory of error-co...