Polynomials for generating selection sets with complementary quotients in guided scrambling line coding

被引：9

作者：

Xin, Y ^{[1
]}

Fair, IJ

机构：

[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2G7, Canada

[2] TRLabs, Edmonton, AB T5K 2P7, Canada

来源：

ELECTRONICS LETTERS | 2001年 / 37卷 / 06期

关键词：

Binary sequences - Block codes - Mathematical models - Polynomials - Theorem proving;

D O I：

10.1049/el:20010257

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Necessary and sufficient conditions are presented which ensure that base polynomials in guided scrambling line coding generate complementary quotients in all quotient selection sets. The relationship between augmenting bit patterns and complementary quotients is also given.

引用

页码：365 / 366

页数：2