On the minimum description length principle for sources with piecewise constant parameters

DOI10.1109/18.265504MaRDI QIDQ4307474zbMATHOpenAlexFDO

Authors Neri Merhav

Publication date 22 January 1995

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

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

zbMATH Keywords

segmentationedge detectionminimum description lengthsequential codingsequential universal encoderuniversal lossless coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On the redundancy of universal lossless coding for general piecewise stationary sources
• Universal Lossless Coding for Sources With Repeating Statistics
• Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
• Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
• The minimum description length principle in coding and modeling

Cited in

(4)

• Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
• Csiszar's cutoff rates for arbitrary discrete sources
• Compression based homogeneity testing
• Minimum Description Length Principle for Fat-Tailed Distributions

This page was built for publication: On the minimum description length principle for sources with piecewise constant parameters

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