Classical and quantum information theory: An introduction for the telecom scientist

Classical and Quantum Information Theory: An Introduction for the Telecom Scientist

Volumn 9780521881715, Issue , 2009, Pages 1-691

  Desurvire, Emmanuel ^a  

^a THALES RESEARCH AND TECHNOLOGY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STORAGE EQUIPMENT; DIGITAL STORAGE; ENGINEERING EDUCATION; INFORMATION THEORY; QUANTUM COMMUNICATION; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; STUDENTS; TELECOMMUNICATION INDUSTRY;

DATA STORAGE SYSTEMS; ELECTRICAL ENGINEERING AND COMPUTER SCIENCE; MATHEMATICAL DETAILS; MODERN TECHNOLOGIES; OF QUANTUM-INFORMATION; QUANTUM COMPUTING; QUANTUM INFORMATION THEORY; TELECOMMUNICATIONS INDUSTRY;

QUANTUM OPTICS;

EID: 84925060972     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511803758     Document Type: Book

References (196)

1. A. Einstein, B. Podolsky, and N. Rosen, Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47 (1935), 777-80.
2. http://mathworld.wolfram.com/BinomialCoefficient.html
3. www.math.sdu.edu.cn/mathency/math/b/b219.htm.
4. http://en.wikipedia.org/wiki/Birthday paradox
5. http://mathworld.wolfram.com/CentralLimitTheorem.html.
6. www.stat.sc.edu/∼west/javahtml/CLT.html
7. www.rand.org/statistics/applets/clt.html
8. www.math.csusb.edu/faculty/stanton/m262/central limit theorem/clt old.html
9. www.ruf.rice.edu/%7Elane/stat sim/sampling dist/index.html
10. www.vias.org/simulations/simusoft cenlimit.html.
11. www.stat.sc.edu/∼west/javahtml/CLT.html.
12. http://en.wikipedia.org/wiki/information_science
13. http://en.wikipedia.org/wiki/Computer_science.
14. A. Rényi, A Diary on Information Theory (New York: John Wiley & Sons, 1984), p. 10.
15. http://en.wikipedia.org/wiki/Entropy.
16. C. E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J., 27 (1948), 379-423, 623-56.
17. http://cm.bell-labs.com/cm/ms/what/shannonday/paper.html.
18. F. Pratt, Secret and Urgent (Indianapolis: The Bobbs-Merrill Book Company, 1942).
19. J. C. Hancock, An Introduction to the Principles of Communication Theory (New York: McGraw Hill, 1961).
20. H. Fouché-Gaines, Cryptanalysis, a study of ciphers and their solutions (New York: Dover Publications, 1956).
21. S. Singh, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography (New York: Anchor Books, 1999).
22. www.tim-thompson.com/entropy1.html
23. www.panspermia.org/seconlaw.htm
24. http://en.wikipedia.org/wiki/Entropy.
25. E. Desurvire, How close to maximum entropy is amplified coherent light? Opt. Fiber Technol., 6 (2000), 357.
26. E. Desurvire, D. Bayart, B. Desthieux, and S. Bigo, Erbium-Doped Fiber Amplifiers: Device and System Developments (New York: John Wiley & Sons, 2002), p. 202.
27. www.answers.com/topic/principle-of-maximum-entropy?cat=technology&hl?function=hl?derivation=&hl?partition=
28. www.answers.com/maximum+entropy+probability+distribution?cat=technology.
29. http://en.wikipedia.org/wiki/Differential_entropy.
30. T. M. Cover and J. A. Thomas, Elements of Information Theory (New York: John Wiley & Sons, 1991)
31. http://home.mira.net/∼reynella/debate/informat.htm
32. http://en.wikipedia.org/wiki/Kolmogorov_complexity, http://szabo.best.vwh.net/kolmogorov.html.
33. http://plato.stanford.edu/archives/spr2002/entries/turing-machine/
34. http://en.wikipedia.org/wiki/Universal_Turing_machine
35. www.turing.org.uk/turing/
36. www.alanturing.net/, www.cs.usfca.edu/
37. www.AlanTuring.net/turing_archive/pages/Reference%20Articles/What%20is%20a%20Turing20Machine.html.
38. www.ams.org/featurecolumn/archive/turing_multiply_code.html
39. http://ironphoenix.org/tril/tm/, www.turing.org.uk/turing/scrapbook/tmjava.html
40. www.cheransoft.com/vturing/index.html.
41. http://ironphoenix.org/tril/tm/
42. www.turing.org.uk/turing/scrapbook/tmjava.html
43. www.cheransoft.com/vturing/index.html.
44. http://en.wikipedia.org/wiki/Transcendental_number.
45. http://en.wikipedia.org/wiki/Church-Turing_thesis
46. http://www.cs.princeton.edu/introcs/76universality/.
47. http://en.wikipedia.org/wiki/Church-Turing_thesis
48. http://en.wikipedia.org/wiki/Universal_Turing_machine.
49. http://pass.maths.org.uk/issue5/turing/
50. http://en.wikipedia.org/wiki/Halting_problem.
51. T. M. Cover and J. A. Thomas, Elements of information theory (New York: John Wiley & Sons, 1991).
52. www.befria.nu/elias/pi/binpi.html.
53. http://mathworld.wolfram.com/PiFormulas.html
54. www.geom.uiuc.edu/∼huberty/math5337/groupe/expresspi.html
55. http://en.wikipedia.org/wiki/Pi.
56. http://antwrp.gsfc.nasa.gov/htmltest/gifcity/sqrt2.1mil.
57. http://en.wikipedia.org/wiki/Kolmogorov_complexity.
58. G. J. Chaitin, Atheory of program size formally identical to information theory.JACM, 22 (1975), 329-40
59. www.cs.auckland.ac.nz/CDMTCS/chaitin/acm75.pdf.
60. G. J. Chaitin, Algorithmic information theory. IBM J. Res. Dev., 21 (1977), 350-9, 496
61. www.cs.auckland.ac.nz/CDMTCS/chaitin/ibm.pdf.
62. T. M. Cover and J. A. Thomas, Elements of information theory (New York: John Wiley & Sons, 1991).
63. http://en.wikipedia.org/wiki/Roman_numerals#IIII_or_IV.3 F
64. http://ostermiller.org/calc/roman.html
65. http://en.wikipedia.org/wiki/Arabic_numerals.
66. http://en.wikipedia.org/wiki/Greek_numerals.
67. E. Desurvire, Wiley Survival Guide in Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography, (New York: J. Wiley & Sons, 2004).
68. http://-wikipedia.org/wiki/ASCII.
69. http://en.wikipedia.org/wiki/Electrical_telegraph.
70. T. M. Cover and J. A. Thomas, Elements of Information Theory (New York: John Wiley & Sons, 1991).
71. T. M. Cover and J. A. Thomas, Elements of Information Theory (New York: John Wiley & Sons, 1991).
72. D. J. C. MacKay, Information Theory, Inference and Learning Algorithms (Cambridge, UK: Cambridge University Press, 2003).
73. R. G. Gallager, Variations on a theme by Huffman. IEEE Trans. Inform. Theory, 24 (1978), 668-74.
74. R. M. Capocelli, R. Giancarlo, and I. J. Taneja, Bounds on the redundancy of Huffman codes. IEEE Trans. Infor. Theory, 32 (1986), 854-7.
75. H. Fouché-Gaines, Cryptanalysis, a Study of Ciphers and Their Solutions (New York: Dover Publications, 1956).
76. http://en.wikipedia.org/wiki/At_sign.
77. www.compressconsult.com/huffman/#codelengths
78. www.cs.mu.oz.au/∼alistair/inplace.c.
79. www.ics.uci.edu/∼dan/pubs/DC-Sec4.html.
80. B. Osgood, Mathematics of the Information Age (2004), p. 64, at www-ee.stanford.edu/∼osgood/Sophomore%20College/Math%20of%20Info.htm.
81. http://en.wikipedia.org/wiki/Elias_omega_coding.
82. D. A. Lelewer and D. S. Hirschberg, Data compression. Computing Surveys, 19 (1987), 261-97
83. www.ics.uci.edu/∼dan/pubs/DataCompression.html.
84. www.webrary.org/Maillist/msg/2001/2/Re.missingletterquotEquot.html
85. www.ling.ed.ac.uk/linguist//issues/11/11-1701.html#?CFID=18397914&CFTOKEN=46891046.
86. D. J. C. MacKay, A Short Course in Information Theory (Cambridge, UK: Cambridge University Press, 2003).
87. www.inference.phy.cam.ac.uk/dasher
88. D. A. Lelewer and D. S. Hirschberg, Data compression. Computing Surveys, 19 (1987), 261-97
89. www.ics.uci.edu/∼dan/pubs/DataCompression.html.
90. R. G. Gallager, Variations on a theme by Huffman. IEEE Trans. Inform. Theory, 24 (1978), 668-74.
91. T. M. Cover and J. A. Thomas Elements of Information Theory (New York: John Wiley & Sons, 1991).
92. D. A. Lelewer and D. S. Hirschberg, Data compression. Computing Surveys, 19 (1987), 261-97.
93. www.ics.uci.edu/∼dan/pubs/DataCompression.html
94. D. J. C. MacKay, Information Theory, Inference and Learning Algorithms (Cambridge: Cambridge University Press, 2003).
95. J. G. Proakis, Digital Communications (New York: McGraw Hill, 2001), pp. 438-9
96. http://en.wikipedia.org/wiki/Viterbi_algorithm.
97. J. G. Proakis, Digital Communications (New York: McGraw Hill, 2001), pp. 492-6.
98. www.aero.org/publications/crosslink/winter2002/04.html.
99. www.aero.org/publications/crosslink/winter2002/04.html.
100. http://users.tkk.fi/∼pat/coding/essays/turbo.pdf
101. http://www.csee.wvu.edu/∼mvalenti/documents/valenti01.pdf.
102. O. Ait Sab and J. Fang, Concatenated forward error correction schemes for longhaul DWDM optical transmission systems. In Proc. European Conference on Optical Communications, ECOC'99, Vol. II (1999), p. 290.
103. A. A. Bruen and M. A. Forcinito, Cryptography, Information Theory and Error-Correction (New York: John Wiley & Sons, 2005).
104. T. M. Cover and J. A. Thomas, Elements of Information Theory (New York: John Wiley & Sons, 1991), p. 191.
105. C. E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J., 27 (1948), 379-423, 623-56
106. http://cm.bell-labs.com/cm/ms/what/shannonday/shannon1948.pdf.
107. A. A. Bruen and M. A. Forcinito, Cryptography, Information Theory and Error-Correction (New York: John Wiley & Sons, 2005), Ch. 12.
108. http://en.wikipedia.org/wiki/Shannon%E2%80%93Hartley_theorem.
109. S. Haykin, Digital Communications (New York: J.Wiley & Sons, 1988)
110. J. G. Proakis, Digital Communications, 4th edn. (New York: McGraw Hill, 2001).
111. E. Desurvire, Survival Guides Series in Global Telecommunications, Signaling Principles, Network Protocols and Wireless Systems (New York: J. Wiley & Sons, 2004).
112. S. Haykin, Digital Communications (New York: J. Wiley & Sons, 1988)
113. J. G. Proakis, Digital Communications, 4th edn. (New York: McGraw Hill, 2001)
114. E. Desurvire, Erbium-Doped Fiber Amplifiers, Devices and System Developments (New York: J. Wiley & Sons, 2002), Ch. 3.
115. P. P. Mitra and J. B. Stark, Nonlinear limits to the information capacity of optical fiber communications. Nature, 411 (2001), 1027
116. E. Desurvire, Erbium-Doped Fiber Amplifiers, Devices and System Developments (New York: J. Wiley & Sons, 2002), Ch. 3.
117. E. Desurvire, Erbium-Doped Fiber Amplifiers, Devices and System Developments (New York: J. Wiley & Sons, 2002), Ch. 3.
118. http://en.wikipedia.org/wiki/Maxwell%27s_demon
119. http://users.ntsource.com/∼neilsen/papers/demon/node3.html.
120. http://en.wikipedia.org/wiki/Landauer%27s_principle.
121. http://en.wikipedia.org/wiki/Von_Neumann_architecture.
122. http://en.wikipedia.org/wiki/Central_processing_unit.
123. http://en.wikipedia.org/wiki/Turing-complete.
124. http://en.wikipedia.org/wiki/Flip-flop_(electronics)
125. http://computer.howstuffworks.com/boolean3.htm
126. www.eelab.usyd.edu.au/digital_tutorial/part3/fl-types.htm.
127. http://fr.wikipedia.org/wiki/Unit%C3%A9_arithm%C3%A9tique_et_logique.
128. www.ac-nancy-metz.fr/enseign/ssi/ressourcesP/Documentation/GE/TTL/74hc181.pdf.
129. http://tams-www.informatik.uni-hamburg.de/applets/hades/webdemos/20-arithmetic/50-74181/demo-74181-ALU.html.
130. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge: Cambridge University Press, 2000)
131. V. Vedral and M. B. Plenio, Basics of quantum computation. Prog. Quant. Electron., 22 (1998), 1-39.
132. http://en.wikipedia.org/wiki/De_Morgan%27s_laws.
133. V. Vedral and M. B. Plenio, Basics of quantum computation. Prog. Quant. Electron., 22 (1998), 1-39.
134. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge: Cambridge University Press, 2000)
135. V. Vedral and M. B. Plenio, Basics of quantum computation. Prog. Quant. Electron., 22 (1998), 1-39.
136. http://en.wikipedia.org/wiki/Schr%C3%B6dinger's_cat.
137. http://en.wikipedia.org/wiki/Levi-Civita_symbol.
138. V. Vedral and M. B. Plenio, Basics of quantum computation. Prog. Quant. Electron., 22 (1998), 1-39.
139. http://en.wikipedia.org/wiki/Determinant.
140. E. Desurvire, Erbium-Doped Fiber Amplifiers, Device and System Developments (New York: J. Wiley & Sons, 2002), pp. 97-111.
141. S. M. Barnett and D. T. Pegg, On the Hermitian phase operator. J. Modern Optics, 36 (1989), 7-19
142. D. T. Pegg and S. M. Barnett, Phase properties of the quantized in single-mode electromagnetic field. Phys. Rev. A, 39 (1989), 1665.
143. D. Gottesman and I. L. Chuang, Quantum teleportation is a universal computational primitive. Nature, 402 (1999), 390-3
144. http://arxiv.org/PS_cache/quant-ph/pdf/9908/9908010v1.pdf.
145. Y.-F. Huang, X.-F. Ren, Y.-S. Zhang, L.-M. Duan, and G.-C. Guo, Experimental teleportation of a quantum controlled-NOT gate. Phys. Rev. Letts., 93 (2004), id. 240501
146. http://arxiv.org/abs/quant-ph/0408007.
147. www.iqc.ca/activities/projects/msilva01.php.
148. http://en.wikipedia.org/wiki/Discrete_Fourier_transform.
149. http://en.wikipedia.org/wiki/Complexity_classes_P_and_NP.
150. http://en.wikipedia.org/wiki/Grover's_algorithm.
151. http://arxiv.org/abs/quant-ph/0301079.
152. http://en.wikipedia.org/wiki/List_of_prime_numbers
153. www.math.utah.edu/∼pa/math/primelist.html
154. http://primes.utm.edu/lists/small/1000.txt
155. http://primes.utm.edu/lists/small/millions/.
156. http://en.wikipedia.org/wiki/Integer_factorization.
157. http://en.wikipedia.org/wiki/General_number_field_sieve.
158. www.rsa.com/press_release.aspx?id=3520.
159. http://mathworld.wolfram.com/RSANumber.html.
160. http://en.wikipedia.org/wiki/Euclidean_algorithm.
161. http://users.pandora.be/nicvroom/progrm19.htm.
162. http://primes.utm.edu/lists/small/1000.txt
163. http://en.wikipedia.org/wiki/List_of_prime_numbers
164. http://primes.utm.edu/; www.prime-numbers.org/
165. www.rsok.com/∼jrm/printprimes.html.
166. S. Singh, The Code Book (New York: Anchor Books, 1999)
167. S. Levy, Crypto (Harmondsworth: Penguin Books, 2001)
168. D. Kahn, The Codebreakers, the Story of Secret Writing (New York: Scribner, 1967).
169. E. Desurvire, Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography (New York: J. Wiley and Sons, 2004), Ch. 3, pp. 345-478
170. B. Schneier, Applied Cryptography (New York: J. Wiley and Sons, 2006).
171. E. Desurvire, Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography (New York: J. Wiley and Sons, 2004).
172. http://en.wikipedia.org/wiki/Group_%28mathematics%29
173. http://en.wikipedia.org/wiki/Subgroup.
174. http://en.wikipedia.org/wiki/Lagrange%27s_theorem_%28group_theory%29
175. D. Kahn, The Code Breakers (New York: Scribner, 1967)
176. S. Singh, The Code Book (New York: Anchor Books, 1999)
177. S. Levy, Crypto, (New York: Penguin Books, 2001).
178. E. Desurvire, Wiley Survival Guide in Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography (New York: J. Wiley & Sons, 2004), Ch. 3, pp. 345-477.
179. http://en.wikipedia.org/wiki/Enigma machine
180. www.codesandciphers.org.uk/enigma/index.htm
181. www.mlb.co.jp/linux/science/genigma/enigma-referat/enigma-referat.html
182. www.enigmahistory.org/simulators.html.
183. http://en.wikipedia.org/wiki/ASCII
184. www.webopedia.com/quick ref/asciicode.asp
185. www.neurophys.wisc.edu/comp/docs/ascii/.
186. http://primes.utm.edu/lists/small/1000.txt
187. www.math.utah.edu/∼pa/math/primelist.html.
188. www.rsa.com/rsalabs/node.asp?id=2093.
189. RSA Bulletin 13 (2000), www.rsa.com/rsalabs/node.asp?id=2088.
190. RSA Bulletin 13 (2000), www.rsa.com/rsalabs/node.asp?id=2088.
191. B. Schneir, Applied Cryptography, 3rd edn. (New York: John Wiley and Sons, 1996).
192. E. Desurvire, Wiley Survival Guide in Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography (New York: John Wiley and Sons, 2004), Ch. 3, pp. 345-477.
193. E. Desurvire, Wiley Survival Guide in Global Telecommunications, Broadband Access, Optical Components and Networks, and Cryptography (New York: John Wiley and Sons, 2004), Ch. 3, pp. 345-477.
194. http://physicsworld.com/cws/article/print/11360/1/smallphotons
195. http://physicsworld.com/cws/article/news/24358
196. www.quantum.at/research/quantum-teleportation-communication-entanglement/entangled-photons-over-144-km.html.