Name
Abstract | ||
|---|---|---|
With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ITWITWN.2007.4318046 | Solstrand |
Keywords | Field | DocType |
network error correction coding,local encoding kernels,gilbert-varshamov bound,error correction codes,network hamming weight,refined coding bounds,linear network code,singleton bound,hamming bound,block codes,hamming weight,encoding,decoding,pattern matching,hamming distance,network coding,error correction code,error correction,kernel | Discrete mathematics,Combinatorics,Gilbert–Varshamov bound,Linear network,Error detection and correction,Coding (social sciences),Theoretical computer science,Hamming bound,Singleton bound,Mathematics,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
978-1-4244-1200-6 | 14 | 1.24 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghao Yang | 1 | 128 | 15.00 |
| Raymond W. Yeung | 2 | 4302 | 580.31 |