Varieties of binary linear codes
β Scribed by R. Quackenbush
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 84 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In 1996 Rosenthal and York proposed (timeβinvariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.
New varieties of comma-free codes CFC of length 3 on the 4-letter alphabet are defined and analysed: self-complementary comma-free codes (CCFC), C 3 comma-free codes (C 3 CFC), C 3 self-complementary comma-free codes (C 3 CCFC), selfcomplementary maximal comma-free codes (CMCFC), C 3 maximal comma-f