Sciweavers

1060 search results - page 75 / 212
» Notes on Coding Theory
Sort
View
TCOM
2010
111views more  TCOM 2010»
14 years 8 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
ICSE
2009
IEEE-ACM
15 years 4 months ago
Succession: Measuring transfer of code and developer productivity
Code ownership transfer or succession is a crucial ingredient in open source code reuse and in offshoring projects. Measuring succession can help understand factors that affect ...
Audris Mockus
FAST
2009
14 years 7 months ago
A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage
Over the past five years, large-scale storage installations have required fault-protection beyond RAID-5, leading to a flurry of research on and development of erasure codes for m...
James S. Plank, Jianqiang Luo, Catherine D. Schuma...
ICC
2011
IEEE
203views Communications» more  ICC 2011»
13 years 9 months ago
Constellation Shaping for Bit-Interleaved Coded APSK
—This paper considers a technique for shaping a turbo-coded amplitude-phase shift keying (APSK) constellation. After bit-interleaving, a subset of the bits output by a binary tur...
Matthew C. Valenti, Xingyu Xiang
DCC
2005
IEEE
15 years 9 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic