Run-length encodings (Corresp.)
From MaRDI portal
Publication:5515793
DOI10.1109/TIT.1966.1053907zbMath0141.14202WikidataQ56067751 ScholiaQ56067751MaRDI QIDQ5515793
Publication date: 1966
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (40)
A new multistage lattice vector quantization with adaptive subband thresholding for image compression ⋮ A near-lossless image compression algorithm suitable for hardware design in wireless endoscopy system ⋮ An efficient method to evaluate intersections on big data sets ⋮ Generalized unary coding ⋮ Binary codes for locally homogeneous sequences ⋮ Towards efficient positional inverted index ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Color image steganography scheme using gray invariant in AMBTC compression domain ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Scalability and communication in parallel low-complexity lossless compression ⋮ ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES ⋮ Fast decoding algorithms for variable-lengths codes ⋮ Efficient Associative Computation with Discrete Synapses ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Lempel-Ziv data compression on parallel and distributed systems ⋮ Parallel lossless image compression using Huffman and arithmetic coding ⋮ A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES ⋮ Binary image compression via monochromatic pattern substitution: sequential and parallel implementations ⋮ Mathematical vanity plates ⋮ Reordering columns for smaller indexes ⋮ A combinatorial approach to Golomb forests ⋮ A new algorithm for the embedding of a prediction mechanism into the JPEG2000 coding chain ⋮ Memory Capacities for Synaptic and Structural Plasticity ⋮ On the importance of error resilience in visual communications over noisy channels ⋮ A compression method for clustered bit-vectors ⋮ Distance Transformation on Two-Dimensional Irregular Isothetic Grids ⋮ Supporting random access in files of variable length records ⋮ Huffman-type codes for infinite source distributions ⋮ The single-pass perceptual embedded zero-tree coding implementation on DSP ⋮ Rearranging data to maximize the efficiency of compression ⋮ Enumeration of constant-weight run-length limited binary sequences ⋮ SPACE-TIME SURFACE SIMPLIFICATION AND EDGEBREAKER COMPRESSION FOR 2D CEL ANIMATIONS ⋮ Bicriteria Data Compression ⋮ Neural associative memory for brain modeling and information retrieval ⋮ Searching and encoding for infinite ordered sets ⋮ Signature files and signature trees. ⋮ Text compression methods ⋮ New compression schemes for natural number sequences ⋮ Universal coding for memoryless sources with countably infinite alphabets ⋮ Adaptive succinctness
This page was built for publication: Run-length encodings (Corresp.)
