query: a coding theory question about inequality
positive_passages.docid: 20075
positive_passages.text: Probabilistic method Kraft-McMillan inequality
negative_passages.docid: 27587
negative_passages.text: inequality on the unit disk
negative_passages.docid: 83160
negative_passages.text: Inequality from Chapter 5 of the book *How to Think Like a Mathematician*
negative_passages.docid: 57850
negative_passages.text: Bounding an Error on the inverse.
negative_passages.docid: 138959
negative_passages.text: On the equality case of the Hölder and Minkowski inequalities
negative_passages.docid: 13228
negative_passages.text: Proofs of AM-GM inequality
negative_passages.docid: 126632
negative_passages.text: Proving Inequalities with Absolute values
negative_passages.docid: 27840
negative_passages.text: What about $[n,k,7]$ binary perfect code? (Exercise from the book Fundamentals of Error Correcting Codes)
negative_passages.docid: 66151
negative_passages.text: Solving inequality for convex functions.
negative_passages.docid: 122156
negative_passages.text: An inequality concerning three positive numbers
negative_passages.docid: 53112
negative_passages.text: Proving using AM-GM inequality
negative_passages.docid: 88605
negative_passages.text: Proof of the Reverse Triangle Inequality
negative_passages.docid: 120309
negative_passages.text: Number Theory Inequality Proof
negative_passages.docid: 62578
negative_passages.text: Using AM-GM inequality
negative_passages.docid: 106815
negative_passages.text: Better bound for integral inequality
negative_passages.docid: 2708
negative_passages.text: Inequality ${n \choose k} \leq \left(\frac{en}{ k}\right)^k$
negative_passages.docid: 156669
negative_passages.text: Trying to prove a simple (?) inequality