Recoding-derived bounds for input encoding

DOI10.1016/0045-7906(90)90011-4MaRDI QIDQ758212zbMATH OpenOpenAlexFDO

Authors Wayne Wolf

Publication date 1990

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7906(90)90011-4

zbMATH Keywords

Boolean networkfinite-state machinesstate assignment algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4047591
• Source coding bounds using quantizer reproduction levels (Corresp.)
• scientific article; zbMATH DE number 1803256
• Refinement of the Random Coding Bound
• Bounds on the Rate of 2-D Bit-Stuffing Encoders
• Decoding complexity bound for linear block codes
• A lower bound on the encoding length in lossy transmission
• Upper bounds on sequential decoding performance parameters
• Decoding algorithms with input quantization and maximum error correction capability

Cited in

(4)

• scientific article; zbMATH DE number 4047592 (Why is no real title available?)
• FSMs state encoding targeting at logic level minimization
• An efficient technique for obtaining unate implementation of functions through input encoding
• INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS

This page was built for publication: Recoding-derived bounds for input encoding

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