liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cyclically permutable codes
Linköping University, Department of Electrical Engineering, Data Transmission. Linköping University, The Institute of Technology.
1997 (English)Doctoral thesis, monograph (Other academic)
Resource type
Text
Abstract [en]

A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation.

Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. direct-sequence modulation or frequency-hopping. Advantages of code-division multiple-access to conventional access methods, such as timedivision and frequency-division, include greater flexibility, better robustness and that no synchronization among the transmitters is needed.

Among our main results are an efficient method of selecting cyclically distinct codewords from linear cyclic codes, a new family of sequences for direct-sequence modulation, several constructions of hopping-sequences for multiple-access coupled with a decoding algorithm for asynchronous communication.

We have also constructed new binary constant-weight codes of high minimum distance.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 1997. , 132 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 501
National Category
Discrete Mathematics Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-123299ISBN: 91-7219-029-9 (print)OAI: oai:DiVA.org:liu-123299DiVA: diva2:881225
Public defence
1997-11-14, C3, HusC, Campus Valla, Linköping, 10:15 (English)
Opponent
Supervisors
Available from: 2015-12-10 Created: 2015-12-10 Last updated: 2015-12-10Bibliographically approved

Open Access in DiVA

fulltext(563 kB)76 downloads
File information
File name FULLTEXT01.pdfFile size 563 kBChecksum SHA-512
a05e873a215fcac35576b7e7eb3a67bacd2d5e45cefd1d4ba4db982de8a6d84fcce1e86b28cd1eaa568d6f447f90fc32baccd2edf09e6e509ee39e0d3c243551
Type fulltextMimetype application/pdf

By organisation
Data TransmissionThe Institute of Technology
Discrete MathematicsCommunication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 76 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 54 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf