Inductive proof of an important inequality (Corresp.)

DOI10.1109/TIT.1969.1054341zbMATH Open0988.94508OpenAlexW2086623509MaRDI QIDQ4537863FDOQ4537863

Authors: John H. Jun. Park 

Publication date: 8 July 2002

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

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

Recommendations

• scientific article; zbMATH DE number 1506510
• Proof of one inequality in identification theory
• An inequality for the binary entropy function and an application to binomial coefficients
• scientific article; zbMATH DE number 1286649
• scientific article; zbMATH DE number 1160363

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cited In (5)

• Title not available (Why is that?)
• On nonnegative matrices with given row and column sums
• Use of a Differential Inequality in Combinatorics
• An inequality for the binary entropy function and an application to binomial coefficients
• An Inductive Proof of a Known Result about ψ(x)

This page was built for publication: Inductive proof of an important inequality (Corresp.)

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