Sciweavers

40 search results - page 2 / 8
» Linear Codes and Character Sums
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs. Linear Precoding
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
Juyul Lee, Nihar Jindal
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 7 months ago
Linear programming bounds for unitary space time codes
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
Jean Creignou, Hervé Diet
AAECC
1997
Springer
99views Algorithms» more  AAECC 1997»
13 years 11 months ago
Extension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
Jay A. Wood
TDHMS
2008
13 years 6 months ago
Constructing Good Covering Codes for Applications in Steganography
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
Jürgen Bierbrauer, Jessica J. Fridrich
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 7 months ago
On Construction of the (24,12,8) Golay Codes
Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8, 4, ...
Xiao-Hong Peng, Paddy G. Farrell