Circular Tuscan-k Arrays from Permutation Binomials

Authors: Chu W.1; Golomb S.W.2

Source: Journal of Combinatorial Theory, Series A, Volume 97, Number 1, January 2002 , pp. 195-202(8)

Publisher: Academic Press

Buy & download fulltext article:

OR

Price: $52.63 plus tax (Refund Policy)

Abstract:

In this paper, we first discuss some properties of permutation polynomials over finite fields. In particular, a class of permutation binomials are introduced and a series of set complete mappings is constructed. Based on that, we present a new construction for Tuscan-l arrays with various sizes. © 2002 Elsevier Science

Language: English

Document Type: Miscellaneous

Affiliations: 1: Department of Mathematics, University of Southern California, Los Angeles, California, 90089 2: Communication Sciences Institute, University of Southern California, Electrical Engineering Systems, EEB 500, Los Angeles, California, 90089

Publication date: 2002-01-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page