Sciweavers

1016 search results - page 23 / 204
» Linear error-block codes
Sort
View
TIT
1998
123views more  TIT 1998»
13 years 10 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
TCOM
2010
142views more  TCOM 2010»
13 years 6 months ago
Performance Bounds and Distance Spectra of Variable Length Codes in Turbo/Concatenated Systems
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
Xavier Jaspar, Luc Vandendorpe
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
12 years 1 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 3 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
CORR
2007
Springer
60views Education» more  CORR 2007»
13 years 11 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap