An efficient algorithm for testing immutability of variable-length codes

DOI10.1109/18.45290MaRDI QIDQ3472051zbMATH OpenOpenAlexFDO

Authors Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro

Publication date 1989

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

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

zbMATH Keywords

Immutable codesvariable-length code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Publication:3033705
• Efficient q-ary immutable codes
• Some algorithms concerning uniquely decipherable codes
• scientific article; zbMATH DE number 4118303
• Deciding the immutability of regular codes and languages under finite transduction

Cited in

(6)

• Deciding the immutability of regular codes and languages under finite transduction
• Efficient q-ary immutable codes
• scientific article; zbMATH DE number 4132092 (Why is no real title available?)
• scientific article; zbMATH DE number 4057450 (Why is no real title available?)
• scientific article; zbMATH DE number 4118303 (Why is no real title available?)
• Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing

This page was built for publication: An efficient algorithm for testing immutability of variable-length codes

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