Sciweavers

1579 search results - page 3 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
61
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 9 months ago
Construction and Applications of CRT Sequences
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p...
Kenneth W. Shum, Wing Shing Wong
TIT
1998
79views more  TIT 1998»
14 years 9 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
TWC
2010
14 years 4 months ago
Rateless coding for MIMO fading channels: performance limits and code construction
In this letter the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the sys...
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor
TIT
2011
125views more  TIT 2011»
14 years 4 months ago
Exact-Repair MDS Code Construction Using Interference Alignment
Abstract—The high repair cost of (n;k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes, called Repair MDS codes, that can signific...
Changho Suh, Kannan Ramchandran
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...