Construction of Multiple Access Channel Codes Based on Hash Property
Information Theory
2012-10-26 v1 math.IT
Abstract
The aim of this paper is to introduce the construction of codes for a general discrete stationary memoryless multiple access channel based on the the notion of the hash property. Since an ensemble of sparse matrices has a hash property, we can use sparse matrices for code construction. Our approach has a potential advantage compared to the conventional random coding because it is expected that we can use some approximation algorithms by using the sparse structure of codes.
Cite
@article{arxiv.1210.6719,
title = {Construction of Multiple Access Channel Codes Based on Hash Property},
author = {Jun Muramatsu and Shigeki Miyake},
journal= {arXiv preprint arXiv:1210.6719},
year = {2012}
}
Comments
This paper has been presented in part at Proc. 2011 IEEE Internal Symposium on Information Theory and submitted to IEEE Transactions on Information Theory. 39 pages