Home > Research > Publications & Outputs > Cyclic codes for T-user channel over integer ri...
View graph of relations

Cyclic codes for T-user channel over integer rings.

Research output: Contribution to Journal/MagazineJournal article

Published

Standard

Cyclic codes for T-user channel over integer rings. / Fan, P. Z.; Darnell, M.; Honary, B.; da Rocha, V. C.

In: Electronics Letters, Vol. 30, No. 3, 1994, p. 209-210.

Research output: Contribution to Journal/MagazineJournal article

Harvard

APA

Vancouver

Fan PZ, Darnell M, Honary B, da Rocha VC. Cyclic codes for T-user channel over integer rings. Electronics Letters. 1994;30(3):209-210.

Author

Fan, P. Z. ; Darnell, M. ; Honary, B. ; da Rocha, V. C. / Cyclic codes for T-user channel over integer rings. In: Electronics Letters. 1994 ; Vol. 30, No. 3. pp. 209-210.

Bibtex

@article{52f5a0eec3864ae69fa4a001cc37de1b,
title = "Cyclic codes for T-user channel over integer rings.",
abstract = "Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic codes with symbols from an arbitrary finite integer ring. The code construction is based on the factorisation of xn-1 over the unit ring of an appropriate extension of a finite integer ring. Any number of users in the system can be independently active and the maximum achievable sum rate is 1 (when all T users are active)",
keywords = "cyclic codes, decoding, encoding, polynomials, T-user adder channel, code construction, factorisation, integer rings, synchronous noiseless channel.",
author = "Fan, {P. Z.} and M. Darnell and B. Honary and {da Rocha}, {V. C.}",
note = "{"}{\textcopyright}1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.{"} {"}This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.{"}",
year = "1994",
language = "English",
volume = "30",
pages = "209--210",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "3",

}

RIS

TY - JOUR

T1 - Cyclic codes for T-user channel over integer rings.

AU - Fan, P. Z.

AU - Darnell, M.

AU - Honary, B.

AU - da Rocha, V. C.

N1 - "©1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." "This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."

PY - 1994

Y1 - 1994

N2 - Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic codes with symbols from an arbitrary finite integer ring. The code construction is based on the factorisation of xn-1 over the unit ring of an appropriate extension of a finite integer ring. Any number of users in the system can be independently active and the maximum achievable sum rate is 1 (when all T users are active)

AB - Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic codes with symbols from an arbitrary finite integer ring. The code construction is based on the factorisation of xn-1 over the unit ring of an appropriate extension of a finite integer ring. Any number of users in the system can be independently active and the maximum achievable sum rate is 1 (when all T users are active)

KW - cyclic codes

KW - decoding

KW - encoding

KW - polynomials

KW - T-user adder channel

KW - code construction

KW - factorisation

KW - integer rings

KW - synchronous noiseless channel.

M3 - Journal article

VL - 30

SP - 209

EP - 210

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 3

ER -