Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

THE UPPER BOUNDS OF A FEEDBACK FUNCTION

THE UPPER BOUNDS OF A FEEDBACK FUNCTION DEMONSTRATIO MATHEMATICAVol. XXXIINo 31999Jerzy ZurawieckiT H E U P P E R B O U N D S OF A F E E D B A C K F U N C T I O N1. IntroductionThe feedback functions and the corresponding recurring sequences —having numerous applications, for instance in coding theory, in cryptography or in several branches of electrical engineering — have been studiedwith methods of linear algebra, ideal theory or formal power series [3], [5].In 1963 Yoeli [10] published two theorems dealing with sequences joiningand a sequence splitting. This has led to a design of algorithms for findingthe Hamiltonian circuits in a de Bruijn graph (cf. [2], [9], [11]). In moregeneral case, the paper [10] yields a tool for studying connections betweenthe feedback functions and allows us to describe them as the elements of apartially ordered set. For a study of this order it is convenient to investigatethe families of upper bounds and lower bounds of a feedback function.As it has been stated in [8], the family of lower bounds of a feedbackfunction — which forms an upper semilattice — is described by a binaryrelation, called the independent splits relation, closely related to the interlacing relation defined http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Demonstratio Mathematica de Gruyter

THE UPPER BOUNDS OF A FEEDBACK FUNCTION

Demonstratio Mathematica , Volume 32 (3): 12 – Jul 1, 1999

Loading next page...
 
/lp/de-gruyter/the-upper-bounds-of-a-feedback-function-xrg5pO3xd9

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
© by Jerzy Żurawiecki
ISSN
0420-1213
eISSN
2391-4661
DOI
10.1515/dema-1999-0302
Publisher site
See Article on Publisher Site

Abstract

DEMONSTRATIO MATHEMATICAVol. XXXIINo 31999Jerzy ZurawieckiT H E U P P E R B O U N D S OF A F E E D B A C K F U N C T I O N1. IntroductionThe feedback functions and the corresponding recurring sequences —having numerous applications, for instance in coding theory, in cryptography or in several branches of electrical engineering — have been studiedwith methods of linear algebra, ideal theory or formal power series [3], [5].In 1963 Yoeli [10] published two theorems dealing with sequences joiningand a sequence splitting. This has led to a design of algorithms for findingthe Hamiltonian circuits in a de Bruijn graph (cf. [2], [9], [11]). In moregeneral case, the paper [10] yields a tool for studying connections betweenthe feedback functions and allows us to describe them as the elements of apartially ordered set. For a study of this order it is convenient to investigatethe families of upper bounds and lower bounds of a feedback function.As it has been stated in [8], the family of lower bounds of a feedbackfunction — which forms an upper semilattice — is described by a binaryrelation, called the independent splits relation, closely related to the interlacing relation defined

Journal

Demonstratio Mathematicade Gruyter

Published: Jul 1, 1999

There are no references for this article.