Recursive constructions of detecting matrices for multiuser coding: a unifying approach

Authors:
Wai Ho Mow
Affiliations:
Department of Electrical and Computer Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong S.A.R., China
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 5
Cited 1

Multiuser Coding Based on Detecting Matrices for Synchronous-CDMA Systems

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Nearly optimal multiuser codes for the binary adder channel

IEEE Transactions on Information Theory
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

IEEE Transactions on Information Theory
Coding scheme for synchronous-CDMA systems

IEEE Transactions on Information Theory
A new approach to the design of codes for synchronous-CDMA systems

IEEE Transactions on Information Theory

Compressed genotyping

IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience

Quantified Score

Hi-index	754.84

Visualization

Abstract

Detecting matrices are a class of combinatorial objects originated from the coin weighing problem of Söderberg and Shapiro in the early 1960s. In this paper, various known recursive construction techniques for binary, bipolar, and ternary detecting matrices are reexamined in a unifying framework. New, general recursive constructions of detecting matrices, which include previous recursive constructions as special cases, are derived. Such matrices find applications in multiuser coding since they are equivalent to a certain class of uniquely decodable multiuser codes for the binary adder channel. Interestingly, it is found that among the three kinds of detecting matrices, ternary detecting matrices are of fundamental significance from the combinatorial theoretic, as well as from the multiuser coding application, point of view.