DeepAI AI Chat
Log In Sign Up

A construction of UD k-ary multi-user codes from (2^m(k-1)+1)-ary codes for MAAC

by   Shan Lu, et al.

In this paper, we proposed a construction of a UD k-ary T-user coding scheme for MAAC. We first give a construction of k-ary T^f+g-user UD code from a k-ary T^f-user UD code and a k^±-ary T^g-user difference set with its two component sets D^+ and D^- a priori. Based on the k^±-ary T^g-user difference set constructed from a (2k-1)-ary UD code, we recursively construct a UD k-ary T-user codes with code length of 2^m from initial multi-user codes of k-ary, 2(k-1)+1-ary, ..., (2^m(k-1)+1)-ary. Introducing multi-user codes with higer-ary makes the total rate of generated code A higher than that of conventional code.


page 1

page 2

page 3

page 4


A construction of maximally recoverable codes

We construct a family of linear maximally recoverable codes with localit...

Multiple-Rate Channel Codes in GF(p^n^2)

A code C(n, k, d) defined over GF(q^n) is conventionally designed to enc...

Unsupervised Feature Construction for Improving Data Representation and Semantics

Feature-based format is the main data representation format used by mach...

Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets

This paper provides a construction of non-binary LDPC convolutional code...

QC-LDPC Codes from Difference Matrices and Difference Covering Arrays

We give a framework for generalizing LDPC code constructions that use Tr...

Bayesian calibration of a numerical code for prediction

Field experiments are often difficult and expensive to make. To bypass t...

Protection of Information from Imitation on the Basis of Crypt-Code Structures

A system is offered for imitation resistant transmitting of encrypted in...