Name
Title | ||
|---|---|---|
A Recursive Construction of the Set of Binary Entropy Vectors and Related Algorithmic Inner Bounds for the Entropy Region |
Abstract | ||
|---|---|---|
A method for checking membership in the region of entropic vectors generated from $N$ bits is presented. A general technique for utilizing this method to create inner bounds for regions of entropic vectors as a function of outer bounds is then presented. These two algorithms are then used to provide new insights regarding relationships among well known bounds for the region of entropic vectors. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2011.2165817 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
entropy,vectors,algorithmic inner bound,binary entropy vector set,entropic vector region,outer bound,recursive construction,Binary entropic vectors,information inequalities,network coding capacity region | Linear network coding,Channel code,Discrete mathematics,Combinatorics,Random variable,Computer science,Binary entropy function,Packet switching,Recursion | Journal |
Volume | Issue | ISSN |
57 | 10 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John MacLaren Walsh | 1 | 107 | 17.90 |
| Steven Weber | 2 | 724 | 53.55 |