181 search results - page 12 / 37 » On the Number of Errors Correctable with Codes on Graphs |
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
— A special kind of symbol-wise puncturing is applied to the code symbols of a constituent trellis coded modulation (TCM) within two very bandwidth-efficient concatenated coding...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
SACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we propose a novel multi-class graph boosting algorithm to recognize different visual objects. The proposed method treats subgraph as feature to construct base clas...
JSAC
2006
13 years 7 months ago
2006
Abstract--In this paper, we present an unequal power allocation technique to increase the throughput of code-division multiple-access (CDMA) systems with chip-level interleavers. P...