With the help of a computer, we obtain the minimum distance of some codes belonging to two families of Z2k -linear codes: the first is the generalized Kerdock codes which aren’t as good as the best linear codes and the second is the Hensel lift of quadratic residue codes. In the latter, we found new codes with same minimum distances as the best linear codes of same length and same cardinality. ...

The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the closest codeword. A couple of relations involving the Newton and covering radii are discussed. c © 2001 Elsevier Science B.V. All rights reserved.

In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...

The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitive automorphism group. @ 1998 Elsevier Scienc B.V. All rights reserved

Due to mushroom development of wireless devices cognitive radio is used to resolve the bandwidth utilization and sacristy problem. The crafty usage of bandwidth in cognitive radio based on error correcting codes is ensured to accomodate un authorized user. This study proposes a transmission model by which a finite sequence of binary cyclic codes constructed by a binary BCH code of length n = 2s...

In this work we revisit the known algorithms for searching for low weight codewords in linear binary codes. We propose some improvements on them and also propose a new efficient heuristic.

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 a doubly-even self-dual G-invariant code if and only if n is a multiple of 8, every simple self-dual F2G-module occurs with even multiplicity in F n 2 , and G is contained in the alternating group.