Some New Constructions for Simplex Codes

Hong Y. Song; Solomon W. Golomb

doi:10.1109/18.312174

Some New Constructions for Simplex Codes

Hong Y. Song, Solomon W. Golomb

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

Abstract

Three constructions for n-dimensional regular simplex codes i, 0 < i < n, are proposed, two of which have the property that αi,- for 1 < i < n is a cyclic shift of a1. The first method is shown to work for all the positive integers n = 1,2,… using only three real values. It turns out that these values are rational whenever n + 1 is a square of some integer. Whenever a (”, k, A) cyclic (or Abelian) difference set exists, this method is generalized so that a similar method is shown to work with v = n (the number of dimensions).

Original language	English
Pages (from-to)	504-507
Number of pages	4
Journal	IEEE Transactions on Information Theory
Volume	40
Issue number	2
DOIs	https://doi.org/10.1109/18.312174
Publication status	Published - 1994 Mar

Bibliographical note

Funding Information:
Manuscript received November 4, 1992: revised May 6, 1993. This work was supported in part by the United States Office of Naval Research under Grant Numbei N00014-90-5-1341. The author!. are with the Department of EE-Systems, Communication Sciences Institute, University of Southern California, Los Angeles, CA 90089 USA. IEEE Log Number 9215440.

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.312174

Cite this

@article{6d82658e97104749984668ee04e3e9ae,

title = "Some New Constructions for Simplex Codes",

abstract = "Three constructions for n-dimensional regular simplex codes i, 0 < i < n, are proposed, two of which have the property that αi,- for 1 < i < n is a cyclic shift of a1. The first method is shown to work for all the positive integers n = 1,2,… using only three real values. It turns out that these values are rational whenever n + 1 is a square of some integer. Whenever a (”, k, A) cyclic (or Abelian) difference set exists, this method is generalized so that a similar method is shown to work with v = n (the number of dimensions).",

author = "Song, {Hong Y.} and Golomb, {Solomon W.}",

note = "Funding Information: Manuscript received November 4, 1992: revised May 6, 1993. This work was supported in part by the United States Office of Naval Research under Grant Numbei N00014-90-5-1341. The author!. are with the Department of EE-Systems, Communication Sciences Institute, University of Southern California, Los Angeles, CA 90089 USA. IEEE Log Number 9215440.",

year = "1994",

month = mar,

doi = "10.1109/18.312174",

language = "English",

volume = "40",

pages = "504--507",

journal = "IRE Professional Group on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Some New Constructions for Simplex Codes

AU - Song, Hong Y.

AU - Golomb, Solomon W.

N1 - Funding Information: Manuscript received November 4, 1992: revised May 6, 1993. This work was supported in part by the United States Office of Naval Research under Grant Numbei N00014-90-5-1341. The author!. are with the Department of EE-Systems, Communication Sciences Institute, University of Southern California, Los Angeles, CA 90089 USA. IEEE Log Number 9215440.

PY - 1994/3

Y1 - 1994/3

N2 - Three constructions for n-dimensional regular simplex codes i, 0 < i < n, are proposed, two of which have the property that αi,- for 1 < i < n is a cyclic shift of a1. The first method is shown to work for all the positive integers n = 1,2,… using only three real values. It turns out that these values are rational whenever n + 1 is a square of some integer. Whenever a (”, k, A) cyclic (or Abelian) difference set exists, this method is generalized so that a similar method is shown to work with v = n (the number of dimensions).

AB - Three constructions for n-dimensional regular simplex codes i, 0 < i < n, are proposed, two of which have the property that αi,- for 1 < i < n is a cyclic shift of a1. The first method is shown to work for all the positive integers n = 1,2,… using only three real values. It turns out that these values are rational whenever n + 1 is a square of some integer. Whenever a (”, k, A) cyclic (or Abelian) difference set exists, this method is generalized so that a similar method is shown to work with v = n (the number of dimensions).

UR - http://www.scopus.com/inward/record.url?scp=0028384673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028384673&partnerID=8YFLogxK

U2 - 10.1109/18.312174

DO - 10.1109/18.312174

M3 - Article

AN - SCOPUS:0028384673

SN - 0018-9448

VL - 40

SP - 504

EP - 507

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

IS - 2

ER -

Some New Constructions for Simplex Codes

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this