Abstract
From the background of a memoryless communication system, we introduce the definition of the generalized scrambling indices for a primitive digraph, which are natural extensions of the scrambling index and m-competition index. Moreover, we provide some exact lower and upper bounds for the generalized scrambling indices of various classes of primitive digraphs, respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
