Communication Over Finite-Chain-Ring Matrix Channels
暂无分享,去创建一个
Frank R. Kschischang | Danilo Silva | Chen Feng | Roberto Wanderley da Nóbrega | F. Kschischang | Chen Feng | Danilo Silva | R. Nóbrega
[1] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.
[2] Michael Gastpar,et al. Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.
[3] B. Sundar Rajan,et al. An efficient algorithm for constructing minimal trellises for codes over finite abelian groups , 1996, IEEE Trans. Inf. Theory.
[4] Danilo Silva,et al. On multiplicative matrix channels over finite chain rings , 2013, 2013 International Symposium on Network Coding (NetCod).
[5] Stefan E. Schmidt,et al. Network coding with modular lattices , 2010, ArXiv.
[6] B. R. McDonald. Enumeration of classes of row equivalent matrices over a principal ideal domain modulo $p\sp{n}$ , 1970 .
[7] Frank R. Kschischang,et al. Communication Over Finite-Field Matrix Channels , 2008, IEEE Transactions on Information Theory.
[8] John A. Howell,et al. Spans in the module (Zm ) s , 1986 .
[9] L. E. Fuller. A Canonical Set For Matrices Over a Principal Ideal Ring Modulo m , 1955, Canadian Journal of Mathematics.
[10] B. R. McDonald. Finite Rings With Identity , 1974 .
[11] Shenghao Yang,et al. Capacity Analysis of Linear Operator Channels Over Finite Fields , 2014, IEEE Transactions on Information Theory.
[12] Bernard R. McDonald,et al. Linear Algebra over Commutative Rings , 1984 .
[13] A. Storjohann. Algorithms for matrix canonical forms , 2000 .
[14] Yu-Chih Huang,et al. Lattices Over Eisenstein Integers for Compute-and-Forward , 2014, IEEE Transactions on Information Theory.
[15] Thomas Honold,et al. Linear Codes over Finite Chain Rings , 1999, Electron. J. Comb..
[16] Bartolomeu F. Uchôa Filho,et al. On the Capacity of Multiplicative Finite-Field Matrix Channels , 2011, IEEE Transactions on Information Theory.
[17] Graham H. Norton,et al. On the Structure of Linear and Cyclic Codes over a Finite Chain Ring , 2000, Applicable Algebra in Engineering, Communication and Computing.
[18] Garrett Birkhoff,et al. Subgroups of Abelian Groups , 1935 .
[19] Qifu Tyler Sun,et al. Lattice Network Codes Based on Eisenstein Integers , 2013, IEEE Transactions on Communications.
[20] Suhas N. Diggavi,et al. On the Capacity of Noncoherent Network Coding , 2011, IEEE Transactions on Information Theory.
[21] Alexander Sprintson,et al. Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.
[22] A. A. Nechaev,et al. Finite Rings with Applications , 2008 .
[23] Suhas N. Diggavi,et al. On the capacity of non-coherent network coding , 2009, 2009 IEEE International Symposium on Information Theory.
[24] William C. Brown,et al. Matrices over commutative rings , 1993 .
[25] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[26] Andrea Montanari,et al. Iterative Coding for Network Coding , 2013, IEEE Transactions on Information Theory.
[27] Frank R. Kschischang,et al. An Algebraic Approach to Physical-Layer Network Coding , 2010, IEEE Transactions on Information Theory.