23 search results - page 4 / 5 » Perfect binary codes: bounds and properties |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
COMBINATORICS
1999
13 years 7 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...