On codes satisfying the double chain condition (Q1377755)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On codes satisfying the double chain condition |
scientific article; zbMATH DE number 1110019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On codes satisfying the double chain condition |
scientific article; zbMATH DE number 1110019 |
Statements
On codes satisfying the double chain condition (English)
0 references
26 January 1998
0 references
The double chain condition of \([n,k,d]\) codes is described. The main part of the paper is a determination of the parameters for which there exist \([n,k,d]\) codes that satisfy the double chain condition and have trellis complexity 1 or 2 as well as constructions of such codes. In these cases the corresponding trellises have 2 or 4 states. In addition a number of general bounds on the length and the weight hierarchy of codes satisfying the double chain condition are given.
0 references
double chain condition
0 references
trellis complexity
0 references
bounds
0 references
weight hierarchy
0 references
0 references
0 references
0 references
0.9054631
0 references
0.8918949
0 references
0 references
0 references
0 references
0.8812443
0 references
0.8801234
0 references
0.8763055
0 references
