Almost cover-free codes and designs
An s -subset of codewords of a binary code X is said to be ( s , ℓ ) -bad in X if the code X contains a subset of ℓ other codewords such that the conjunction of the ℓ codewords is covered by the disjunctive sum of the s codewords. Otherwise, the s -subset of codewords of X is called ( s , ℓ ) -good...
Uložené v:
| Vydané v: | Designs, codes, and cryptography Ročník 82; číslo 1-2; s. 231 - 247 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer US
01.01.2017
Springer Nature B.V |
| Predmet: | |
| ISSN: | 0925-1022, 1573-7586 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | An
s
-subset of codewords of a binary code
X
is said to be
(
s
,
ℓ
)
-bad
in
X
if the code
X
contains a subset of
ℓ
other codewords such that the conjunction of the
ℓ
codewords is covered by the disjunctive sum of the
s
codewords. Otherwise, the
s
-subset of codewords of
X
is called
(
s
,
ℓ
)
-good
in
X
. A binary code
X
is said to be a cover-free (CF)
(
s
,
ℓ
)
-code if the code
X
does not contain
(
s
,
ℓ
)
-bad subsets. In this paper, we introduce a natural
probabilistic
generalization of CF
(
s
,
ℓ
)
-codes, namely: a binary code
X
is said to be an almost CF
(
s
,
ℓ
)
-code if the relative number of its
(
s
,
ℓ
)
-good
s
-subsets is close to 1. We develop a random coding method based on the ensemble of binary constant weight codes to obtain lower bounds on the capacity of such codes. Our main result shows that the capacity for almost CF
(
s
,
ℓ
)
-codes is essentially greater than the rate for ordinary CF
(
s
,
ℓ
)
-codes. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0925-1022 1573-7586 |
| DOI: | 10.1007/s10623-016-0279-3 |