Information Theoretic Analysis and Performance Gains of 3-Color Shift Keying

2021 ◽  
pp. 1-1
Author(s):  
Alexandros E. Tzikas ◽  
Panagiotis D. Diamantoulakis ◽  
George K. Karagiannidis
2018 ◽  
Vol 64 (4) ◽  
pp. 781-790
Author(s):  
Eduardo Garro ◽  
Jordi Joan Gimenez ◽  
Peter Klenner ◽  
David Gomez-Barquero

2021 ◽  
pp. 102986492110254
Author(s):  
Roger Chaffin ◽  
Jane Ginsborg ◽  
James Dixon ◽  
Alexander P. Demos

To perform reliably and confidently from memory, musicians must able to recover from mistakes and memory failures. We describe how an experienced singer (the second author) recovered from mistakes and gaps in recall as she periodically recalled the score of a piece of vocal music that she had memorized for public performance, writing out the music six times over a five-year period following the performance. Five years after the performance, the singer was still able to recall two-thirds of the piece. When she made mistakes, she recovered and went on, leaving gaps in her written recall that lengthened over time. We determined where in the piece gaps started ( losses) and ended ( gains), and compared them with the locations of structural beats (starts of sections and phrases) and performance cues ( PCs) that the singer reported using as mental landmarks to keep track of her progress through the piece during the sung, public performance. Gains occurred on structural beats where there was a PC; losses occurred on structural beats without a PC. As the singer’s memory faded over time, she increasingly forgot phrases that did not start with a PC and recovered at the starts of phrases that did. Our study shows how PCs enable musicians to recover from memory failures.


2011 ◽  
Vol 4 ◽  
pp. 183-192 ◽  
Author(s):  
Khan Md. Mahfuzus Salam ◽  
Tetsuro Nishino ◽  
Kazutoshi Sasahara ◽  
Miki Takahasi ◽  
Kazuo Okanoya

Author(s):  
Subhashish Banerjee ◽  
Ashutosh Kumar Alok ◽  
R. Srikanth ◽  
Beatrix C. Hiesmayr

2012 ◽  
Vol 457-458 ◽  
pp. 1499-1507 ◽  
Author(s):  
Si Guang Chen ◽  
Meng Wu ◽  
Wei Feng Lu

In this work we consider the problem of designing a secret error-correcting network coding scheme against an adversary that can re-select the tapping links in different time slot and inject z erroneous packets into network. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to the eavesdropping attack. We then design an error-correcting scheme by combining the rank-metric codes with shared secret model, which can decode the transmitted information correctly provided a sufficiently large q. With that, a secret error-correcting network coding is proposed by combining this error-correcting scheme with secret communication. We show that under the requirement of communication can achieve a rate of packets. Moreover, it ensures that the communicated information is reliable and information-theoretic security from the adversary. In particular, the requirement of packet length is not as large as the required in [12]. Finally, the security and performance analyses illustrate the characteristics of our scheme.


Sign in / Sign up

Export Citation Format

Share Document