238 search results - page 7 / 48 » Covering Codes for Hats-on-a-line |
COMBINATORICS
2007
14 years 9 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
MMSEC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
161
Voted
VSTTE
2012
Springer
13 years 5 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
DCC
2008
IEEE
15 years 9 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 , ...