完整後設資料紀錄
DC 欄位語言
dc.contributor.author謝清俊zh_TW
dc.contributor.authorC.C.Hsiehen_US
dc.date.accessioned2017-10-06T06:18:03Z-
dc.date.available2017-10-06T06:18:03Z-
dc.date.issued1972-01en_US
dc.identifier.urihttp://hdl.handle.net/11536/137482-
dc.description.abstractThis paper contains two parts. In one part, the minimum length required to identifying two periodic sequences will be formulated. In the other, two methods for decomposing a periodic sequence into two or more periodic sequences which have periods shorter than that of the original sequence will be presented. The theorems and methods derived in this paper may be applied to many fields, such as coding and decoding implementations,data processing, numerical analysis, data compression,etc.en_US
dc.language.isoen_USen_US
dc.publisher交大學刊編輯委員會zh_TW
dc.titleA Study on Periodic Sequencesen_US
dc.typeCampus Publicationsen_US
dc.identifier.journal交大學刊zh_TW
dc.identifier.journalSCIENCE BULLETIN NATIONAL CHIAO-TUNG UNIVERSITYen_US
dc.citation.volume5en_US
dc.citation.issue2en_US
dc.citation.spage103en_US
dc.citation.epage115en_US
顯示於類別:交大學刊


文件中的檔案:

  1. HT001301-10.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。