Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
36
click to vote
DAM
2000
favorite
Email
discuss
report
78
views
more
DAM 2000
»
On (n, k)-sequences
13 years 10 months ago
Download
www.costasarrays.org
An (n; k)-sequence has been studied. A permutation a1; a2; : : : ; akn of 0; 1; : : : ; kn - 1 is an (n; k)-sequence if as+d -as at+d -at (mod n) whenever as+d=n = as=n and at+d=n = at=n for every s; t and d with 16s
Hong-Yeop Song, June Bok Lee
Real-time Traffic
-as At+d
|
DAM 2000
|
Prime Construction
|
Primitive Root Modulo P
|
claim paper
Post Info
More Details (n/a)
Added
18 Dec 2010
Updated
18 Dec 2010
Type
Journal
Year
2000
Where
DAM
Authors
Hong-Yeop Song, June Bok Lee
Comments
(0)
Researcher Info
DAM 2010 Study Group
Computer Vision