Bounds for code length for circuits of functional elements

DOI10.1515/DMA.1994.4.6.579MaRDI QIDQ3835753zbMATH OpenOpenAlexFDO

Authors I. A. Vikhlyantsev, Alexander E. Andreev

Publication date 22 May 1995

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1994.4.6.579

zbMATH Keywords

measure of complexity of circuitsminimal code lengthupper bound

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• On bounds for complexity of circuits of multi-input functional elements
• scientific article; zbMATH DE number 4189653
• Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
• Refined bounds on Shannon's function for complexity of circuits of functional elements
• On circuits of functional elements of finite depth of branching

Cited in

(9)

• On the complexity of encoding in analog circuits
• Optimal length of decomposition sequences composed of imperfect gates
• scientific article; zbMATH DE number 4218008 (Why is no real title available?)
• scientific article; zbMATH DE number 3932950 (Why is no real title available?)
• scientific article; zbMATH DE number 681260 (Why is no real title available?)
• Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
• scientific article; zbMATH DE number 2187726 (Why is no real title available?)
• Hardware implementation of code converters designed to reduce the length of binary encoded words
• Bounded-depth circuits cannot sample good codes

This page was built for publication: Bounds for code length for circuits of functional elements

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