Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems

DOI10.1023/A:1008393607487MaRDI QIDQ1581788zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Sufang Zhao

Publication date 20 August 2001

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008393607487

zbMATH Keywords

binary codewordsHamming distanceKirkman signal setsresolvable designSteiner triple system

Mathematics Subject Classification ID

Triple systems (05B07)

Review text

The authors prove, by construction, the existence of Kirkman signal sets with \(k=3\) and \(m\) as large as possible. Such objects are important in optical transmission and radio communication and can be described as follows. There are \(s\) users and each requires a signal set consisting of \(m\) binary codewords of length \(v\). All codewords have the same weight which is three in the studied case. Furthermore, the Hamming distance of two codewords within one user's signal set is six, whereas the Hamming distance of codewords from different signal sets is at least four. Thus a signal set \(\text{SS}(v,s,m)\) is a collection of \(s\) sets of \(m\) codewords of length \(v\) satisfying the condition above. A Kirman signal set, \(\text{KSS}(v,m)\), is an \(\text{SS}(v,s,m)\) in which \(s\) realises the maximum as a function of \(v\) and \(m\). Obviously, \(1\leq m\leq\lfloor v/3\rfloor\). When \(m\) is as large as possible, the \(\text{KSS}(v,m)\) is called maximum and such sets are constructed.

Recommendations

• Optimum sequence multisets for synchronous code-division multiple-access channels
• Discrete and Continuous Maxima in Multicarrier Communication
• Optimization of signal sets for partial-response channels. I. Numerical techniques
• Unified Framework for the Synchronization of Flexible Multicarrier Communication Signals
• Max-Min SINR Coordinated Multipoint Downlink Transmission—Duality and Algorithms
• Optimal sequences and sum capacity of synchronous CDMA systems
• Polynomial complexity optimal detection of certain multiple-access systems
• Matched Multiuser Gaussian Source Channel Communications via Uncoded Schemes
• Optimal Signature Sets for Oversaturated Quasi-Scalable Direct-Sequence Spread-Spectrum Systems

Cited in

(4)

• Some new Kirkman signal sets
• Decompositions of complete graphs into bipartite 2-regular subgraphs
• Generalized packing designs
• Trails of triples in partial triple systems

This page was built for publication: Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581788)