Content deleted Content added
m Open access bot: url-access=subscription updated in citation with #oabot. |
Citation bot (talk | contribs) Removed URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine |
||
Line 1,166:
<ref name="Lucas_1883">{{cite book |title=La tour d'Hanoï: Véritable casse tête annamite - Jeu rapporté du Tonkin par le Professeur N. Claus (de Siam) Mandarin du Collège Li Sou Stian! |language=fr |author-first=Édouard |author-last=Lucas |author-link=Édouard Lucas |date=November 1883 |publisher=Imprimerie Paul Bousrez, Tours.}} (NB. N. Claus de Siam is an anagram of Lucas d'Amiens, pseudonym of the author [[Édouard Lucas]].)</ref>
<ref name="Parville_1883">{{cite journal |title=La tour d'Hanoï, véritable casse-tête annamite, jeu rapporté du Tonkin par le professeur N. Claus (de Siam), mandarin du collège Li-Sou-Stian. Un vrai casse-tête, en effet, mais intéressant. Nous ne saurions mieux remercier le mandarin de son aimable intention à l'égard d'un profane qu'en signalant la Tour d'Hanoï aux personnes patientes possédées par le démon du jeu. |language=fr |editor-first=Henri |editor-last=de Parville |editor-link=:fr:Henri de Parville |date=1883-12-27 |journal=[[Journal des Débats Politiques et Littéraires]] |series=Revue des science |type=Review |edition=Matin |publication-place=Paris, France |id=ark:/12148/bpt6k462461g |pages=1–2 [2] |url=https://gallica.bnf.fr/ark:/12148/bpt6k462461g/f2.item |access-date=2020-12-18 |url-status=live |archive-url=https://web.archive.org/web/20201218125345/https://gallica.bnf.fr/ark:/12148/bpt6k462461g/f2.item |archive-date=2020-12-18}} (1 page)</ref>
<ref name="Allardice-Fraser_1883">{{cite journal |title=La Tour d'Hanoï |language=en, fr |editor-first1=Robert Edgar |editor-last1=Allardice |editor-link1=Robert Edgar Allardice |editor-first2=Alexander Yule |editor-last2=Fraser |editor-link2=Alexander Yule Fraser |journal=[[:nl:Proceedings of the Edinburgh Mathematical Society|Proceedings of the Edinburgh Mathematical Society]]<!-- :d:Q15492536 --> |volume=2 |number=5 |date=February 1883 |pages=50–53 |doi=10.1017/S0013091500037147 |issn=0013-0915 |eissn=1464-3839 |publisher=[[Edinburgh Mathematical Society]] |last1=Allardice |first1=R. E. |last2=Fraser |first2=A. Y.
<ref name="Lucas_1892">{{cite book |author-first=Édouard |author-last=Lucas |author-link=Édouard Lucas |title=Récréations mathématiques |language=fr |volume=3 |orig-date=1892 |edition=Librairie Albert Blanchard reissue |date=1979 |page=58}} (The first edition of this book was published post-humously.)</ref>
<ref name="Gros_1872">{{cite book |title=Théorie du baguenodier par un clerc de notaire lyonnais |language=fr |author-first=Luc-Agathon-Louis |author-last=Gros |date=1872 |publisher=[[Aimé Vingtrinier]] |edition=1 |publication-place=Lyon, France |url=https://books.google.com/books?id=EcoBJRekd-sC&pg=PP1 |access-date=2020-12-17 |url-status=live |archive-url=http://archive.wikiwix.com/cache/20170403080613/https://books.google.fr/books?id=EcoBJRekd-sC&pg=PP1 |archive-date=2017-04-03}} [https://web.archive.org/web/20201217202507/https://books.googleusercontent.com/books/content?req=AKW5Qacg5gq7SW9L1sUUqK7LQ0yJLqaCu90GFZZYzcH7dsoifr-n9hxiB30SJ1mXq3FhDejHQ7fXY2ZdzlhFywe8pQGNTgMHjX0ANYxRohedbG1FmoPTuKibswKOO7qS2X4MUwQP0dBn-vt3dfTIBFRvTBOVoZZA1ROBXTGTMybnA4gGndl8v0qIAeKsRNUuEddqabMqMngisr8fp-iNt7NMFfwq_tPk0we0yXNJWj74AFsFr1JGOlAmdQ6B_OJVTOj33IhoYybhf8LMzfpaHusXsY2BWT2ZwVQulW0mgBaem9xvRZ58TSw](2+16+4 pages and 4 pages foldout) (NB. This booklet was published anonymously, but is known to have been authored by Louis Gros.)</ref>
Line 1,192:
<ref name="Richards_1971">{{cite book |author-first=Richard Kohler |author-last=Richards |title=Digital Design |chapter=Snake-in-the-Box Codes |publisher=[[Wiley-Interscience]], [[John Wiley & Sons, Inc.]] |___location=Ames, Iowa, USA |publication-place=New York, USA |date=January 1971 |isbn=0-471-71945-5 |lccn=73-147235 |pages=206–207}} (12+577+1 pages)</ref>
<ref name="Sellers-Hsiao-Bearnson_1968">{{cite book |author-first1=Frederick F. |author-last1=Sellers, Jr.<!-- to be sync'ed with corresponding citeref --> |author-first2=Mu-Yue |author-last2=Hsiao |author-first3=Leroy W. |author-last3=Bearnson |title=Error Detecting Logic for Digital Computers |publisher=[[McGraw-Hill Book Company]] |___location=New York, USA |edition=1st |oclc=439460 |lccn=68-16491 |pages=152–164 |date=November 1968}}</ref>
<ref name="Lucal_1959">{{cite journal |author-first=Harold M. |author-last=Lucal |title=Arithmetic Operations for Digital Computers Using a Modified Reflected Binary |journal=[[IRE Transactions on Electronic Computers]] |volume=EC-8 |number=4 |pages=449–458 |date=December 1959 |issn=0367-9950 |doi=10.1109/TEC.1959.5222057 |s2cid=206673385
<ref name="Spaulding_1954">{{cite web |title=Digital coding and translating system |author-first=Carl P. |author-last=Spaulding |publisher=Datex Corporation |___location=Monrovia, California, USA |year=1965a<!-- necessary for proper citeref linking --> |date=1965-01-12<!-- gdate --> |orig-date=1954-03-09<!-- fdate --> |id={{US patent|3165731A}}. Serial No. 415058 |url=https://patentimages.storage.googleapis.com/7f/1d/09/6a9b1fa3e67cb8/US3165731.pdf |access-date=2018-01-21 |url-status=live |archive-url=https://web.archive.org/web/20200805101618/https://patentimages.storage.googleapis.com/7f/1d/09/6a9b1fa3e67cb8/US3165731.pdf |archive-date=2020-08-05}} (28 pages)</ref>
<ref name="Spaulding_1965">{{cite book |title=How to Use Shaft Encoders |author-first=Carl P. |author-last=Spaulding |year=1965b<!-- necessary for proper citeref linking --> |date=1965-07-12 |publisher=Datex Corporation<!-- Datex Div, of Conrac Corp. / a subsidiary of Giannini Control Corp. --> |___location=Monrovia, California, USA}} (85 pages)</ref>
Line 1,234:
<ref name="Bhat-Savage_1996">{{cite journal |author-first1=Girish S. |author-last1=Bhat |author-first2=Carla Diane |author-last2=Savage |author-link2=Carla Diane Savage |title=Balanced Gray Codes |journal=[[Electronic Journal of Combinatorics]] |date=1996 |volume=3 |url=https://www.combinatorics.org/ojs/index.php/eljc/article/view/v3i1r25/ |issue=1 |doi=10.37236/1249 |doi-access=free}}</ref>
<ref name="Donohue_2003">{{cite web |author-first=Ryan |author-last=Donohue |title=Synchronization in Digital Logic Circuits |date=2003 |url=http://www.stanford.edu/class/ee183/handouts_spr2003/synchronization_pres.pdf |access-date=2018-01-15 |url-status=live |archive-url=https://web.archive.org/web/20180115012747/https://web.stanford.edu/class/ee183/handouts_spr2003/synchronization_pres.pdf |archive-date=2018-01-15}}</ref>
<ref name="Mehta-Owens-Irwin_1996">{{cite book |author-last1=Mehta |author-first1=Huzefa |author-last2=Owens |author-first2=Robert Michael |author-last3=Irwin |author-first3=Mary Jane "Janie" |chapter=Some issues in gray code addressing |title=Proceedings of the Sixth Great Lakes Symposium on VLSI |date=1996-03-22 |issn=1066-1395 |doi=10.1109/GLSV.1996.
<ref name="Su-Tsui-Despain_1994">{{cite report |title=Low Power Architecture Design and Compilation Techniques for High-Performance Processors |author-first1=Ching-Long |author-last1=Su |author-first2=Chi-Ying |author-last2=Tsui |author-first3=Alvin M. |author-last3=Despain |date=1994 |publisher=Advanced Computer Architecture Laboratory |id=ACAL-TR-94-01 |url=http://www.scarpaz.com/2100-papers/Power%20Estimation/su94-low%20power%20architecture%20and%20compilation.pdf |access-date=2020-12-17 |url-status=live |archive-url=https://web.archive.org/web/20200726170626/http://www.scarpaz.com/2100-papers/Power%20Estimation/su94-low%20power%20architecture%20and%20compilation.pdf |archive-date=2020-07-26}}</ref>
<ref name="Guo-Parameswaran_2010">{{cite journal |author-first1=Hui |author-last1=Guo |author-first2=Sri |author-last2=Parameswaran |doi=10.1016/j.sysarc.2010.03.003 |volume=56 |issue=4–6 |date=April–June 2010 |title=Shifted Gray encoding to reduce instruction memory address bus switching for low-power embedded systems |journal=Journal of Systems Architecture |pages=180–190}}</ref>
Line 1,247:
<ref name="Spedding_1994_1">{{cite patent |inventor-last=Spedding |inventor-first=Norman Bruce<!-- Industrial Research Limited --> |pubdate=1994-10-28 |title=A position encoder |country=NZ |number=264738}}{{failed verification|date=July 2015}}</ref>
<ref name="Spedding_1994_2">{{cite web <!-- descriptive title: -->|title=The following is a copy of the provisional patent filed on behalf of Industrial Research Limited on 1994-10-28 – NZ Patent 264738 |author-first=Norman Bruce |author-last=Spedding |publisher=Industrial Research Limited |date=1994-10-28 |id=NZ Patent 264738 |url=http://www.winzurf.co.nz/Single_Track_Grey_Code_Patent/Single_track_Grey_code_encoder_patent.pdf |access-date=2018-01-14 |url-status=live |archive-url=https://web.archive.org/web/20171029205005/http://www.winzurf.co.nz/Single_Track_Grey_Code_Patent/Single_track_Grey_code_encoder_patent.pdf |archive-date=2017-10-29}}</ref>
<ref name="Hiltgen-Paterson-Brandestini_1996">{{cite journal |title=Single-Track Gray Codes |author-last1=Hiltgen |author-first1=Alain P. |author-first2=Kenneth G. |author-last2=Paterson |author-first3=Marco |author-last3=Brandestini |journal=[[IEEE Transactions on Information Theory]] |volume=42 |issue=5 |date=September 1996 |pages=1555–1561 |doi=10.1109/18.532900 |zbl=857.94007
<ref name="Hiltgen-Paterson_2001">{{cite journal |title=Single-Track Circuit Codes |author-last1=Hiltgen |author-first1=Alain P. |author-first2=Kenneth G. |author-last2=Paterson |journal=[[IEEE Transactions on Information Theory]] |volume=47 |issue=6 |date=September 2001 |pages=2587–2595 |doi=10.1109/18.945274 |citeseerx=10.1.1.10.8218 |url=http://www.hpl.hp.com/techreports/2000/HPL-2000-81.pdf |access-date=2018-01-15 |url-status=live |archive-url=https://web.archive.org/web/20180115013155/http://www.hpl.hp.com/techreports/2000/HPL-2000-81.pdf |archive-date=2018-01-15}}</ref>
<ref name="Etzion-Schwartz_1999">{{cite journal |title=The Structure of Single-Track Gray Codes |author-last1=Etzion |author-first1=Tuvi |author-first2=Moshe |author-last2=Schwartz |journal=[[IEEE Transactions on Information Theory]] |volume=IT-45 |issue=7 |date=November 1999 |orig-date=1998-05-17 |pages=2383–2396 |doi=10.1109/18.796379 |citeseerx=10.1.1.14.8333 |url=http://etzion.net.technion.ac.il/files/2016/02/P54.pdf |access-date=2018-01-15 |url-status=live |archive-url=https://web.archive.org/web/20180115022531/http://etzion.net.technion.ac.il/files/2016/02/P54.pdf |archive-date=2018-01-15 }} [https://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi?1998/CS/CS0937 Technical Report CS0937 <!-- https://web.archive.org/web/20180115023816/https://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi?1998/CS/CS0937 -->] {{Webarchive|url=https://web.archive.org/web/20181215171438/http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi?1998/CS/CS0937 |date=2018-12-15 }}</ref>
Line 1,298:
* {{cite web |title=Gray Code Fundamentals |work=Design How-To |at=Part 1 |author-first=Clive "Max" |author-last=Maxfield |date=2012-10-01 |orig-date=2011-05-28 |publisher=[[EETimes]] |url=https://www.eetimes.com/document.asp?doc_id=1278809 |access-date=2017-10-30 |url-status=live |archive-url=https://web.archive.org/web/20171030135842/https://www.eetimes.com/document.asp?doc_id=1278809 |archive-date=2017-10-30}} [https://www.eetimes.com/document.asp?doc_id=1278827<!-- https://web.archive.org/web/20171030140209/https://www.eetimes.com/document.asp?doc_id=1278827 --> Part 2] [https://www.eetimes.com/document.asp?doc_id=1278853<!-- https://web.archive.org/web/20171030140323/https://www.eetimes.com/document.asp?doc_id=1278853 --> Part 3]
* {{cite book |title=Hacker's Delight |title-link=Hacker's Delight |chapter=Chapter 13: Gray Code |author-first=Henry S. |author-last=Warren, Jr. |date=2013 |edition=2 |publisher=[[Addison Wesley]] – [[Pearson Education, Inc.]] |isbn=978-0-321-84268-8 |pages=311–317<!-- page 318 is blank -->}} (7 pages)
* {{cite journal |title=Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers |author-last1=Zinovik |author-first1=Igor |author-last2=Kroening |author-first2=Daniel |author-last3=Chebiryak |author-first3=Yury |journal=[[IEEE Transactions on Information Theory]] |publisher=[[IEEE]] |volume=54 |issue=4 |date=2008-03-21 |pages=1819–1823 |doi=10.1109/TIT.2008.917695
* {{cite journal |author-first=Joseph A. |author-last=O'Brien |title=Unit-Distance Binary-Decimal Code Translators |journal=[[IRE Transactions on Electronic Computers]] |volume=EC-6 |issue=2 |date=June 1957 |issn=0367-9950 |doi=10.1109/TEC.1957.5221585 |pages=122–123 |url=https://www.researchgate.net/publication/250929745 |access-date=2020-05-25}} (2 pages)
* {{cite magazine |title=A decimal Gray code – Easily converted for shaft position coding |author-first=K. G. |author-last=Barr |___location=Faculty of Natural Sciences, [[University of the West Indies]] |date=March 1981 |magazine=[[Wireless World]] |volume=87 |number=1542 |pages=86–87 |url=https://worldradiohistory.com/hd2/IDX-Site-Early-Radio/Archive-Wireless-World-IDX/80s/Wireless-World-1981-03-OCR-Page-0046.pdf |access-date=2020-07-28 |url-status=live |archive-url=https://web.archive.org/web/20200728093447/https://worldradiohistory.com/hd2/IDX-Site-Early-Radio/Archive-Wireless-World-IDX/80s/Wireless-World-1981-03-OCR-Page-0046.pdf |archive-date=2020-07-28}}
| |||