Name
Abstract | ||
|---|---|---|
A new algorithm is presented for computing the minimum weight of additive codes. It is superior to the existing method, achieving performance similar to the Brouwer-Zimmermann algorithm applied to linear codes of the same cardinality. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISIT.2006.261958 | 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
linear code,statistics,galois fields,mathematics,algebra,encoding,helium,additives | Discrete mathematics,Combinatorics,BCJR algorithm,Finite field,Error floor,Turbo code,Algorithm,Cardinality,Minimum weight,Linear code,Mathematics,Encoding (memory) | Conference |
Citations | PageRank | References |
3 | 0.43 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| gregory b white | 1 | 7 | 1.57 |
| Markus Grassl | 2 | 318 | 31.41 |