The problem of the minimum Bhattacharyya distance of group codes over symmetric channels is addressed. Ensembles of ℤm-linear codes are introduced and their typical minimum distance characterized in terms of the Gilbert-Varshamov distances associated to the subgroups of ℤm. For the AWGN channel with 8-PSK as input it is shown that the typical ℤ8 -linear code achieves the Gilbert-Varshamov bound
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
An ensemble of codes defined by parity-check matrices composed of M × M permutation matrices is cons...
Abstract — The problem of the minimum Bhattacharyya dis-tance of group codes over symmetric channels...
In this paper we study ensembles of Abelian group codes on symmetric channels. Our main example is t...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two cap...
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two cap...
We study single error-correcting codes for the asymmetric channel with input and output alphabets be...
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high pr...
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes a...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
We construct a class of codes of length n such that the minimum distance d outside of a certain subc...
AbstractWe continue here the research on (quasi)group codes over (quasi)group rings. We give some co...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
An ensemble of codes defined by parity-check matrices composed of M × M permutation matrices is cons...
Abstract — The problem of the minimum Bhattacharyya dis-tance of group codes over symmetric channels...
In this paper we study ensembles of Abelian group codes on symmetric channels. Our main example is t...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two cap...
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two cap...
We study single error-correcting codes for the asymmetric channel with input and output alphabets be...
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high pr...
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes a...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
We construct a class of codes of length n such that the minimum distance d outside of a certain subc...
AbstractWe continue here the research on (quasi)group codes over (quasi)group rings. We give some co...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
An ensemble of codes defined by parity-check matrices composed of M × M permutation matrices is cons...