Sciweavers

14 search results - page 2 / 3
» Codes from lattice and related graphs, and permutation decod...
Sort
View
DCC
2001
IEEE
14 years 4 months ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey
TIT
2010
129views Education» more  TIT 2010»
12 years 11 months ago
Two-way source coding with a helper
Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the reg...
Haim H. Permuter, Yossef Steinberg, Tsachy Weissma...
ICIP
2002
IEEE
14 years 6 months ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...
SIPS
2008
IEEE
13 years 11 months ago
Scheduling of dataflow models within the Reconfigurable Video Coding framework
The upcoming Reconfigurable Video Coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and deco...
Jani Boutellier, Veeranjaneyulu Sadhanala, Christo...
DCC
2006
IEEE
14 years 4 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey