Sciweavers

76 search results - page 8 / 16
» Random codes: Minimum distances and error exponents
Sort
View
GLOBECOM
2006
IEEE
14 years 23 days ago
Protograph LDPC Codes with Node Degrees at Least 3
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
Dariush Divsalar, Christopher Jones
IWDW
2005
Springer
14 years 6 days ago
Fingerprinting Schemes. Identifying the Guilty Sources Using Side Information
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...
Miguel Soriano, Marcel Fernandez, Josep Cotrina Na...
ICDAR
2009
IEEE
14 years 1 months ago
Error-Correcting Output Coding for the Convolutional Neural Network for Optical Character Recognition
It is known that convolutional neural networks (CNNs) are efficient for optical character recognition (OCR) and many other visual classification tasks. This paper applies error-co...
Huiqun Deng, George Stathopoulos, Ching Y. Suen
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 10 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
TCOM
2010
83views more  TCOM 2010»
13 years 1 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...