Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Hamming weight
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{Reflist|refs= <ref name="CLNZ">{{cite conference | last1 = Cohen | first1 = Gérard D. | author1-link = Gérard Denis Cohen | last2 = Lobstein | first2 = Antoine | last3 = Naccache | first3 = David | last4 = Zémor | first4 = Gilles | editor-last = Nyberg | editor-first = Kaisa | contribution = How to improve an exponentiation black-box | doi = 10.1007/BFb0054128 | pages = 211–220 | publisher = Springer | series = Lecture Notes in Computer Science | title = Advances in Cryptology – EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 – June 4, 1998, Proceeding | volume = 1403 | year = 1998| doi-access = free | isbn = 978-3-540-64518-4 }}</ref> <ref name="Knuth_2009">{{cite book |author-first=Donald Ervin |author-last=Knuth |author-link=Donald Ervin Knuth |title=The Art of Computer Programming |title-link=The Art of Computer Programming |volume=4, Fascicle 1 |chapter=Bitwise tricks & techniques; Binary Decision Diagrams |publisher=[[Addison–Wesley Professional]] |isbn=978-0-321-58050-4 |date=2009}} (NB. Draft of [http://www-cs-faculty.stanford.edu/~knuth/fasc1b.ps.gz Fascicle 1b] {{Webarchive|url=https://web.archive.org/web/20160312073634/http://www-cs-faculty.stanford.edu/~knuth/fasc1b.ps.gz |date=2016-03-12 }} available for download.)</ref> <ref name="Warren_2013">{{cite book |title=Hacker's Delight |title-link=Hacker's Delight |author-first=Henry S. |author-last=Warren Jr. |date=2013 |orig-year=2002 |edition=2 |publisher=[[Addison Wesley]] - [[Pearson Education, Inc.]] |isbn=978-0-321-84268-8 |id=0-321-84268-5 |pages=81–96}}</ref> <ref name="Stoica_2003">{{cite journal |author-last1=Stoica |author-first1=I. |author-last2=Morris |author-first2=R. |author-last3=Liben-Nowell |author-first3=D. |author-last4=Karger |author-first4=D. R. |author-last5=Kaashoek |author-first5=M. F. |author-last6=Dabek |author-first6=F. |author-last7=Balakrishnan |author-first7=H. |title=Chord: a scalable peer-to-peer lookup protocol for internet applications |journal=[[IEEE/ACM Transactions on Networking]] |volume=11 |issue=1 |date=February 2003 |pages=17–32 |doi=10.1109/TNET.2002.808407 |s2cid=221276912 |quote=Section 6.3: "In general, the number of fingers we need to follow will be the number of ones in the binary representation of the distance from node to query."}}</ref> <ref name="Blaxell_1978">{{cite journal |author-last=Blaxell |author-first=David |editor-last1=Hogben |editor-first1=David |editor-last2=Fife |editor-first2=Dennis W. |title=Record linkage by bit pattern matching |pages=146–156 |publisher=[[U.S. Department of Commerce]] / [[National Bureau of Standards]] |series=NBS Special Publication |journal=Computer Science and Statistics--Tenth Annual Symposium on the Interface |url=https://books.google.com/books?id=-MrJPUqTPh8C&pg=PA146 |volume=503 |date=1978}}</ref> <ref name="Wegner_1960">{{cite journal |author-last=Wegner |author-first=Peter <!-- A.? according to Hacker's Delight --> |author-link=Peter Wegner (computer scientist)|doi=10.1145/367236.367286 |issue=5 |journal=[[Communications of the ACM]] |page=322 |title=A technique for counting ones in a binary computer |volume=3 |date=May 1960|s2cid=31683715 |doi-access=free }}</ref> <ref name="GCC">{{cite web |url=https://gcc.gnu.org/gcc-3.4/changes.html |title=GCC 3.4 Release Notes |work=GNU Project}}</ref> <ref name="LLVM">{{cite web |url=http://llvm.org/releases/1.5/docs/ReleaseNotes.html |title=LLVM 1.5 Release Notes |work=LLVM Project}}</ref> <ref name="Glaisher_1899">{{cite journal |author-last=Glaisher |author-first=James Whitbread Lee |author-link=James Whitbread Lee Glaisher |journal=[[The Quarterly Journal of Pure and Applied Mathematics]] |pages=150–156 |title=On the residue of a binomial-theorem coefficient with respect to a prime modulus |url=https://books.google.com/books?id=j7sKAAAAIAAJ&pg=PA150 |volume=30 |date=1899}} (NB. See in particular the final paragraph of p. 156.)</ref> <ref name="Thompson_1983">{{cite book |author-first=Thomas M. |author-last=Thompson |title=From Error-Correcting Codes through Sphere Packings to Simple Groups |publisher=[[The Mathematical Association of America]] |series=The Carus Mathematical Monographs #21 |date=1983 |page=33}}</ref> <ref name="Reed_1954">{{cite journal |author-first=Irving Stoy |author-last=Reed |author-link=Irving Stoy Reed |title=A Class of Multiple-Error-Correcting Codes and the Decoding Scheme |journal=[[IRE Professional Group on Information Theory]] |publisher=[[Institute of Radio Engineers]] (IRE) |volume=PGIT-4 |date=1954 |pages=38–49}}</ref> <ref name="GHC">{{cite web |url=http://www.haskell.org/ghc/docs/7.4-latest/html/users_guide/release-7-4-1.html#id527862 |title=GHC 7.4.1 release notes}} GHC documentation.</ref> <ref name="MySQL_50">{{cite web |url=https://dev.mysql.com/doc/refman/5.0/en/bit-functions.html |title=Chapter 12.11. Bit Functions — MySQL 5.0 Reference Manual}}</ref> <ref name="Metcalf_2011">{{cite book |author-first1=Michael |author-last1=Metcalf |author-first2=John |author-last2=Reid |author-first3=Malcolm |author-last3=Cohen |date=2011 |title=Modern Fortran Explained |publisher=[[Oxford University Press]] |isbn=978-0-19-960142-4 |page=380}}</ref> <ref name="SPARC_1992">{{cite book |author=SPARC International, Inc. |title=The SPARC architecture manual: version 8 |date=1992 |publisher=[[Prentice Hall]] |location=Englewood Cliffs, New Jersey, USA |isbn=0-13-825001-4 |pages=[https://archive.org/details/sparcarchitectur00spar/page/231 231] |chapter-url=https://archive.org/details/sparcarchitectur00spar/page/231 |edition=Version 8 |chapter=A.41: Population Count. Programming Note |chapter-url-access=registration}}</ref> <ref name="HP-16C_1982">{{cite book |title=Hewlett-Packard HP-16C Computer Scientist Owner's Handbook |publisher=[[Hewlett-Packard Company]] |date=April 1982 |id=00016-90001 |url=http://www.hp41.net/forum/fileshp41net/hp16c.pdf<!-- https://www.scss.tcd.ie/SCSSTreasuresCatalog/hardware/TCD-SCSS-T.20160121.004/HP16C-OwnersHandbook.pdf --> |access-date=2017-03-28 |url-status=live |archive-url=https://web.archive.org/web/20170328204119/http://www.hp41.net/forum/fileshp41net/hp16c.pdf<!-- https://web.archive.org/web/20170328201815/https://www.scss.tcd.ie/SCSSTreasuresCatalog/hardware/TCD-SCSS-T.20160121.004/HP16C-OwnersHandbook.pdf --> |archive-date=2017-03-28}}</ref> <ref name="Schwartz_Grevelle_2003">{{cite book |title=HP16C Emulator Library for the HP48S/SX |author-first1=Jake |author-last1=Schwartz |author-first2=Rick |author-last2=Grevelle |date=2003-10-20 |orig-year=1993<!-- 1993-04 --> |edition=1 |version=1.20 |url=http://www.pahhc.org/mul8r.htm |access-date=2015-08-15}} (NB. This library also works on the [[HP 48G]]/[[HP 48GX|GX]]/[[HP 48G+|G+]]. Beyond the feature set of the [[HP-16C]] this package also supports calculations for binary, octal, and hexadecimal [[floating-point number]]s in [[scientific notation]] in addition to the usual decimal floating-point numbers.)</ref> <ref name="Martin_McClure_2015">{{cite web |title=HP16C Emulator Module for the HP-41CX - User's Manual and QRG |author-first1=Ángel M. |author-last1=Martin |author-first2=Greg J. |author-last2=McClure |date=2015-09-05 |url=http://systemyde.com/pdf/HP_16C_Emulator_Manual.pdf |access-date=2017-04-27 |url-status=live |archive-url=https://web.archive.org/web/20170427204416/http://systemyde.com/pdf/HP_16C_Emulator_Manual.pdf |archive-date=2017-04-27}} (NB. Beyond the [[HP-16C]] feature set this custom library for the [[HP-41CX]] extends the functionality of the calculator by about 50 additional functions.)</ref> <ref name="Martin_2015">{{cite web |title=HP-41: New HP-16C Emulator available |author-first=Ángel M. |author-last=Martin |date=2015-09-07 |url=http://www.hpmuseum.org/forum/thread-4663.html |access-date=2017-04-27 |url-status=live |archive-url=https://web.archive.org/web/20170427204721/http://www.hpmuseum.org/forum/thread-4663.html |archive-date=2017-04-27}}</ref> <ref name="Thörngren_2017">{{cite web |author-first=Håkan |author-last=Thörngren |title=Ladybug Documentation |edition=release 0A |date=2017-01-10 |url=http://www.hpmuseum.org/forum/attachment.php?aid=4350 |access-date=2017-01-29}} [http://www.hpmuseum.org/forum/attachment.php?aid=4349]</ref> <ref name="Thörngren_2017_2">{{cite web |title=New HP-41 module available: Ladybug |date=2017-01-10 |url=http://www.hpmuseum.org/forum/thread-7545.html |access-date=2017-01-29 |url-status=live |archive-url=https://web.archive.org/web/20170129182549/http://www.hpmuseum.org/forum/thread-7545.html |archive-date=2017-01-29}}</ref> <ref name="Bonin_2012">{{cite web |author-first1=Paul |author-last1=Dale |author-first2=Walter |author-last2=Bonin |edition=3.1 |title=WP 34S Owner's Manual |date=2012 |orig-year=2008 |url=https://freefr.dl.sourceforge.net/project/wp34s/doc/Manual_wp_34s_3_1.pdf |access-date=2017-04-27}}</ref> <ref name="Bonin_2015">{{cite book |author-first=Walter |author-last=Bonin |edition=3.3 |title=WP 34S Owner's Manual |date=2015 |publisher=CreateSpace Independent Publishing Platform |orig-year=2008 |isbn=978-1-5078-9107-0}}</ref> <ref name="AD_2001">{{cite book |title=Blackfin Instruction Set Reference |date=2001 |publisher=[[Analog Devices]] |edition=Preliminary |pages=8–24 |id=Part Number 82-000410-14}}</ref> <ref name="Donovan_2016">{{cite book |author-first1=Alan |author-last1=Donovan |author-first2=Brian |author-last2=Kernighan |title=The Go Programming Language |date=2016 |publisher=Addison-Weseley |isbn=978-0-13-419044-0}}</ref> <ref name="Mula_2018">{{cite journal |author-last1=Muła |author-first1=Wojciech |author-last2=Kurz |author-first2=Nathan |author-last3=Lemire |author-first3=Daniel |title=Faster Population Counts Using AVX2 Instructions |journal=[[Computer Journal]] |volume=61 |issue=1| date=January 2018 |pages=111–120 |doi=10.1093/comjnl/bxx046 |arxiv=1611.07612|s2cid=540973 }}</ref> <ref name="Bonin_2019_OG">{{cite book |title=WP 43S Owner's Manual |date=2019 |orig-year=2015 |author-last=Bonin |author-first=Walter |isbn=978-1-72950098-9 |edition=draft |version=0.12 |page=135 |url=https://gitlab.com/Over_score/wp43s/raw/master/draft%20documentation/Owner_wp_43s_0_12s.pdf?inline=false |access-date=2019-08-05 }}{{Dead link|date=April 2024 |bot=InternetArchiveBot |fix-attempted=yes }} [https://gitlab.com/Over_score/wp43s] [https://sourceforge.net/projects/wp43s/] (314 pages)</ref> <ref name="Bonin_2019_RG">{{cite book |title=WP 43S Reference Manual |date=2019 |orig-year=2015 |author-last=Bonin |author-first=Walter |isbn=978-1-72950106-1 |edition=draft |version=0.12 |pages=xiii, 104, 115, 120, 188 |url=https://gitlab.com/Over_score/wp43s/raw/master/draft%20documentation/Reference_wp_43s_0_12s.pdf?inline=false |access-date=2019-08-05 }}{{Dead link|date=April 2024 |bot=InternetArchiveBot |fix-attempted=yes }} [https://gitlab.com/Over_score/wp43s] [https://sourceforge.net/projects/wp43s/] (271 pages)</ref> <ref name="FPC docs">{{cite web |title=Free Pascal documentation popcnt |url=https://www.freepascal.org/docs-html/rtl/system/popcnt.html |access-date=2019-12-07 }}</ref> <ref name="JDK_BitCount">{{cite web |title=JDK-6378821: bitCount() should use POPC on SPARC processors and AMD+10h |date=2006-01-30 |website=Java bug database |url=https://bugs.java.com/bugdatabase/view_bug.do?bug_id=6378821}}</ref> <ref name="RISC-V-B">{{cite web |title=RISC-V "B" Bit Manipulation Extension for RISC-V, Draft v0.37 |date=2019-03-22 |author-last=Wolf |author-first=Claire |website=Github |url=https://github.com/riscv/riscv-bitmanip/blob/master/bitmanip-draft.pdf}}</ref> }}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)