Rapid encoding of run lengths and pyramid cubic lattices

DOI10.1109/18.761300zbMATH Open0957.94008OpenAlexW2163156836MaRDI QIDQ4701397FDOQ4701397

Authors: Vladimir N. Potapov, Rafail E. Krichevsky 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.761300

Recommendations

• Enumeration encoding and decoding algorithms for pyramid cubic lattice and trellis codes
• scientific article; zbMATH DE number 2032377
• An effective method for encoding information sources using the fast multiplication algorithm
• Fast and efficient coding of information sources

zbMATH Keywords

rare eventsredundancycoding overheadpyramid cubic lattices

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Rapid encoding of run lengths and pyramid cubic lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701397)