Finite state codes and generalized De Bruijn sequences
This thesis is divided into two self-contained chapters. The first chapter is a study of Finite State Codes. We address the question of unique decodability (UD) of the labelled state diagram which defines the finite state machine-part of the encoder for these codes. Bounds on the number of labels an...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
1991
|
| Online Access: | https://thesis.library.caltech.edu/2841/1/Popovic_l_1991.pdf Popovic, Lada (1991) Finite state codes and generalized De Bruijn sequences. Engineer's thesis, California Institute of Technology. doi:10.7907/21wf-wa45. https://resolver.caltech.edu/CaltechETD:etd-07092007-131600 <https://resolver.caltech.edu/CaltechETD:etd-07092007-131600> |
Internet
https://thesis.library.caltech.edu/2841/1/Popovic_l_1991.pdfPopovic, Lada (1991) Finite state codes and generalized De Bruijn sequences. Engineer's thesis, California Institute of Technology. doi:10.7907/21wf-wa45. https://resolver.caltech.edu/CaltechETD:etd-07092007-131600 <https://resolver.caltech.edu/CaltechETD:etd-07092007-131600>