Another Generalized Golomb-Posner Code

József Dénes; Gary L. Mullen; Stephan J. Suchower

doi:10.1109/18.52491

Another Generalized Golomb-Posner Code

József Dénes
, Gary L. Mullen
, Stephan J. Suchower

Mathematics

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

2 Scopus citations

Abstract

Through the use of mutually orthogonal frequency squares, a generalization of the original Golomb-Posner code is constructed. The minimum distance and weight distribution of the generalized code when it is constructed from a complete set of orthogonal squares over a finite field are also determined.

Original language	English (US)
Pages (from-to)	408-411
Number of pages	4
Journal	IEEE Transactions on Information Theory
Volume	36
Issue number	2
DOIs	https://doi.org/10.1109/18.52491
State	Published - Mar 1990

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.52491

Cite this

@article{82253c2966c54b43b7fdf41b290b3ea1,

title = "Another Generalized Golomb-Posner Code",

abstract = "Through the use of mutually orthogonal frequency squares, a generalization of the original Golomb-Posner code is constructed. The minimum distance and weight distribution of the generalized code when it is constructed from a complete set of orthogonal squares over a finite field are also determined.",

author = "J{\'o}zsef D{\'e}nes and Mullen, \{Gary L.\} and Suchower, \{Stephan J.\}",

note = "Funding Information: Manuscript rcceivcd May 4. IYXY: revised July 7. IYXY. This work was supported in part by the National Sccurity Agency under Grant MDAY04-87-H-2023. The authors are with the Mathematics Department. Pennsylvania State University. University Park. PA 16XO2. IEEE Log Number XY33852.",

year = "1990",

month = mar,

doi = "10.1109/18.52491",

language = "English (US)",

volume = "36",

pages = "408--411",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "2",

}

TY - JOUR

T1 - Another Generalized Golomb-Posner Code

AU - Dénes, József

AU - Mullen, Gary L.

AU - Suchower, Stephan J.

N1 - Funding Information: Manuscript rcceivcd May 4. IYXY: revised July 7. IYXY. This work was supported in part by the National Sccurity Agency under Grant MDAY04-87-H-2023. The authors are with the Mathematics Department. Pennsylvania State University. University Park. PA 16XO2. IEEE Log Number XY33852.

PY - 1990/3

Y1 - 1990/3

N2 - Through the use of mutually orthogonal frequency squares, a generalization of the original Golomb-Posner code is constructed. The minimum distance and weight distribution of the generalized code when it is constructed from a complete set of orthogonal squares over a finite field are also determined.

AB - Through the use of mutually orthogonal frequency squares, a generalization of the original Golomb-Posner code is constructed. The minimum distance and weight distribution of the generalized code when it is constructed from a complete set of orthogonal squares over a finite field are also determined.

UR - https://www.scopus.com/pages/publications/0025399946

UR - https://www.scopus.com/pages/publications/0025399946#tab=citedBy

U2 - 10.1109/18.52491

DO - 10.1109/18.52491

M3 - Article

AN - SCOPUS:0025399946

SN - 0018-9448

VL - 36

SP - 408

EP - 411

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

Another Generalized Golomb-Posner Code

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this