10 search results - page 1 / 2 » On the existence of self-dual permutation codes of finite gr... |
DCC
2012
IEEE
12 years 27 days ago
2012
IEEE
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
TIT
2008
13 years 5 months ago
2008
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group G of degree n there exists...