Nonrecurrent Codes with Minimal Decoding Complexity

A. A. Markov

A chapter in Systems Theory Research, 1973, pp 301-304 from Springer

Abstract: Abstract Let U be a finite system of distinct words in the alphabet A, 𝔄 a free semigroup over A, [U] a subsemigroup of 𝔄, generated by the set U, and λ the empty word. By ||X|| we shall denote the number of elements of the set X, and by |x| the length of the word x.

Date: 1973
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-0079-4_15

Ordering information: This item can be ordered from
http://www.springer.com/9781475700794

DOI: 10.1007/978-1-4757-0079-4_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().