Sciweavers

3373 search results - page 2 / 675
» Linear transformations on codes
Sort
View
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
13 years 9 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
DFT
2005
IEEE
102views VLSI» more  DFT 2005»
13 years 7 months ago
Using Statistical Transformations to Improve Compression for Linear Decompressors
Linear decompressors are the dominant methodology used in commercial test data compression tools. However, they are generally not able to exploit correlations in the test data, an...
Samuel I. Ward, Chris Schattauer, Nur A. Touba
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 5 months ago
Linear Operator Channels over Finite Fields
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
Shenghao Yang, Siu-Wai Ho, Jin Meng, En-Hui Yang
ICIP
2000
IEEE
14 years 6 months ago
Subspaces of Quantization Artifacts for Image Transform Compression
This paper presents a new algorithm for reducing quantization artifacts in transform coded images. For transform coded signals, we analytically show that one can determine linear ...
Onur G. Guleryuz
TIT
2008
74views more  TIT 2008»
13 years 5 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz