Name
Abstract | ||
|---|---|---|
In this paper, we investigate the asymptotic ensemble weight enumerators of multi-edge type codes whose component codes are arbitrary block codes. Two forms of asymptotic growth rate of codewords, corresponding to the primal and dual problems, are obtained. Furthermore, for the codewords of small linear-sized weights, we develop a simplification method to restrict the search space of the primal problem and study the optimality conditions of the dual problem, giving a first-order approximation of the growth rate and a condition of exponentially few small weight codewords. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/GLOCOM.2009.5425440 | GLOBECOM |
Keywords | Field | DocType |
growth rate,primal problem,small linear-sized weight,small weight codewords,arbitrary block codes,first-order approximation,asymptotic growth rate,block codes,codewords,multi-edge type codes,multi-edge type code,dual problem,arbitrary block code,component code,asymptotic ensemble weight enumerators,first order,artificial neural networks,search space,cost function,first order approximation | Discrete mathematics,Combinatorics,Block code,Peer to peer computing,Duality (optimization),Orders of approximation,Artificial neural network,Mathematics,Exponential growth | Conference |
ISSN | ISBN | Citations |
1930-529X | 978-1-4244-4148-8 | 5 |
PageRank | References | Authors |
0.49 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chung-Li Wang | 1 | 76 | 6.09 |
| Shu Lin | 2 | 985 | 72.16 |
| Marc P. C. Fossorier | 3 | 130 | 10.52 |