Pages that link to "Item:Q5510070"
From MaRDI portal
The following pages link to A Method for the Construction of Minimum-Redundancy Codes (Q5510070):
Displaying 50 items.
- The cost of a class of optimal binary trees (Q1844596) (← links)
- Compror: On-line lossless data compression with a factor oracle. (Q1853024) (← links)
- Improved bounds for asymmetric communication protocols. (Q1853071) (← links)
- Block Huffman coding (Q1879563) (← links)
- Lossless compression and information hiding in images (Q1886645) (← links)
- Optimal detection of a counterfeit coin with multi-arms balances (Q1897358) (← links)
- Parallel construction of binary trees with near optimal weighted path length (Q1907235) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Enumerating vertices of the balanced minimum evolution polytope (Q2003580) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools (Q2059909) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- New compression schemes for natural number sequences (Q2112646) (← links)
- The F-transform preprocessing for JPEG strong compression of high-resolution images (Q2123517) (← links)
- Pass-efficient methods for compression of high-dimensional turbulent flow data (Q2123807) (← links)
- A new weighted \((\alpha, \beta)\)-norm information measure with application in coding theory (Q2153463) (← links)
- The cut operation in subclasses of convex languages (extended abstract) (Q2164745) (← links)
- Weighted forward looking adaptive coding (Q2166764) (← links)
- Color image steganography scheme using gray invariant in AMBTC compression domain (Q2192928) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991) (← links)
- Sterrett procedure for the generalized group testing problem (Q2283674) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
- Efficient quantum secure direct communication protocol based on quantum channel compression (Q2300828) (← links)
- Joint image compression-encryption scheme using entropy coding and compressive sensing (Q2308152) (← links)
- Image compression with anisotropic diffusion (Q2319523) (← links)
- Image coding based on maximum entropy partitioning for identifying improbable intensities related to facial expressions (Q2360147) (← links)
- On the maximum length of Huffman codes (Q2366067) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- Finite state models for perception (Q2396127) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Information dynamics at a phase transition (Q2410007) (← links)
- Context adaptive residual coding for efficient compression of MCEEG employing wave atom transforms (Q2415862) (← links)
- A generalization of circulant Hadamard and conference matrices (Q2418986) (← links)
- A new protocol for the detection of node replication attacks in mobile wireless sensor networks (Q2434545) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Online binary minimax trees (Q2444549) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- Compressing table data with column dependency (Q2465060) (← links)
- On the relation between the maximum entropy principle and the principle of least effort (Q2489088) (← links)
- A fast and efficient nearly-optimal adaptive Fano coding scheme (Q2489208) (← links)
- Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825) (← links)
- A note on growing binary trees (Q2555859) (← links)
- Bounds on the weighted path length of binary trees (Q2559138) (← links)
- Optimum extensions of prefix codes. (Q2583535) (← links)
- The topology of language (Q2654144) (← links)
- On the stability of citation networks (Q2683113) (← links)
