Knagenhjelm et al., 2002 - Google Patents
The Hadamard transform-a tool for index assignmentKnagenhjelm et al., 2002
View PDF- Document ID
- 4454405619033918125
- Author
- Knagenhjelm P
- Agrell E
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
We show that the channel distortion for maximum-entropy encoders, due to noise on a binary-symmetric channel, is minimized if the vector quantizer can be expressed as a linear transform of a hypercube. The index assignment problem is regarded as a problem of …
- 239000013598 vector 0 abstract description 65
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Knagenhjelm et al. | The Hadamard transform-a tool for index assignment | |
| Tang et al. | Coded caching schemes with reduced subpacketization from linear block codes | |
| Goyal et al. | Quantized overcomplete expansions in ir/sup n: analysis, synthesis, and algorithms | |
| Howard | The design and analysis of efficient lossless data compression systems | |
| US9503123B1 (en) | Random access to compressed data using bitwise indices | |
| Fout et al. | An adaptive prediction-based approach to lossless compression of floating-point volume data | |
| JP3378257B2 (en) | System and method for nested split coding of sparse datasets | |
| US9209833B1 (en) | Methods and apparatus for rational compression and decompression of numbers | |
| EP2274833B1 (en) | Vector quantisation method | |
| WO1992002897A1 (en) | Image coding utilizing separable transformations | |
| Abarbanel et al. | Prediction and system identification in chaotic nonlinear systems: Time series with broadband spectra | |
| US5535140A (en) | Polynominal-set deriving apparatus and method | |
| Goyal | Transform coding with integer-to-integer transforms | |
| Goyal | Beyond traditional transform coding | |
| US6212662B1 (en) | Method and devices for the transmission of data with transmission error checking | |
| Gray et al. | Nonblock source coding with a fidelity criterion | |
| CN112543092B (en) | Chaotic binary sequence family matrix construction method based on image compressed sensing encryption | |
| Hagen et al. | Robust vector quantization by a linear mapping of a block code | |
| US5790599A (en) | Data compression system using source representation | |
| Balan et al. | Fast algorithms for signal reconstruction without phase | |
| Nguyen et al. | Frame permutation quantization | |
| US12200102B1 (en) | Codebook-based homomorphic encryption for efficient and privacy-preserving data processing | |
| Hansen et al. | Synthesis by spectral translation using Boolean decision diagrams | |
| Jozsa et al. | Universal quantum information compression and degrees of prior knowledge | |
| US6539366B1 (en) | Codec with genetic adaptation |