Sciweavers

215 search results - page 16 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
TIT
2010
111views Education» more  TIT 2010»
14 years 4 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
DM
1999
61views more  DM 1999»
14 years 9 months ago
Some codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X a...
Yves Edel, Jürgen Bierbrauer
COCOON
2009
Springer
15 years 4 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
PR
2008
140views more  PR 2008»
14 years 9 months ago
An incremental node embedding technique for error correcting output codes
The error correcting output codes (ECOC) technique is a useful way to extend any binary classifier to the multiclass case. The design of an ECOC matrix usually considers an a prio...
Oriol Pujol, Sergio Escalera, Petia Radeva
IH
2005
Springer
15 years 3 months ago
Efficient Wet Paper Codes
Abstract. Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipien...
Jessica J. Fridrich, Miroslav Goljan, David Soukal