163 lines
6.7 KiB
BibTeX
163 lines
6.7 KiB
BibTeX
|
@Patent{barcode_patent,
|
|||
|
|
author = {Norman Woodland and Bernard Silver},
|
|||
|
|
number = {2612994},
|
|||
|
|
year = {1952},
|
|||
|
|
type = {patentus},
|
|||
|
|
month = oct,
|
|||
|
|
url = {https://worldwide.espacenet.com/patent/search/family/022402610/publication/US2612994A?q=pn%3DUS2612994},
|
|||
|
|
day = {7},
|
|||
|
|
dayfiled = {20},
|
|||
|
|
language = {EN},
|
|||
|
|
monthfiled = {oct},
|
|||
|
|
nationality = {US},
|
|||
|
|
yearfiled = {1949},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{wiki_code_39,
|
|||
|
|
author = {{Wikipedia contributors}},
|
|||
|
|
date = {2022},
|
|||
|
|
title = {Code 39 --- {Wikipedia}{,} The Free Encyclopedia},
|
|||
|
|
url = {https://en.wikipedia.org/w/index.php?title=Code_39&oldid=1091770428},
|
|||
|
|
language = {en},
|
|||
|
|
urldate = {2022-08-03},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{qrcode_history,
|
|||
|
|
title = {History of QR Code},
|
|||
|
|
url = {https://www.qrcode.com/en/history/},
|
|||
|
|
language = {en},
|
|||
|
|
urldate = {2022-04-06},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@TechReport{ISO18004,
|
|||
|
|
title = {Information technology — Automatic identification and data capture techniques — Bar code symbology — QR Code},
|
|||
|
|
institution = {International Organization for Standardization},
|
|||
|
|
year = {2015},
|
|||
|
|
type = {Standard},
|
|||
|
|
url = {https://www.iso.org/standard/62021.html},
|
|||
|
|
shorttitle = {{ISO}/{IEC} 18004:2015},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{hamming_2,
|
|||
|
|
author = {3Blue1Brown},
|
|||
|
|
date = {2020-09-04},
|
|||
|
|
title = {Hamming codes part 2, the elegance of it all},
|
|||
|
|
url = {https://www.youtube.com/watch?v=b3NxrZOu_CE},
|
|||
|
|
language = {en},
|
|||
|
|
urldate = {2022-04-07},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{hamming_1,
|
|||
|
|
author = {3Blue1Brown},
|
|||
|
|
date = {2020-09-04},
|
|||
|
|
language = {en},
|
|||
|
|
title = {How to send a self-correcting message (Hamming codes)},
|
|||
|
|
url = {https://www.youtube.com/watch?v=X8jsijhllIA},
|
|||
|
|
urldate = {2022-04-07},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@TechReport{ISO16388,
|
|||
|
|
date = {2007},
|
|||
|
|
institution = {International Organization for Standardization},
|
|||
|
|
title = {Information technology — Automatic identification and data capture techniques — Code 39 bar code symbology specification},
|
|||
|
|
type = {Standard},
|
|||
|
|
url = {https://www.iso.org/standard/43897.html},
|
|||
|
|
shorttitle = {{ISO}/{IEC} 16388:2007},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@TechReport{nasa_rs,
|
|||
|
|
author = {William A. Geisel},
|
|||
|
|
date = {1990-08-01},
|
|||
|
|
institution = {NASA Lyndon B. Johnson Space Center Houston, TX, United States},
|
|||
|
|
title = {Tutorial on Reed-Solomon Error Correction Coding},
|
|||
|
|
language = {en},
|
|||
|
|
type = {techreport},
|
|||
|
|
url = {https://ntrs.nasa.gov/api/citations/19900019023/downloads/19900019023.pdf},
|
|||
|
|
abstract = {This tutorial attempts to provide a frank, step-by-step approach to Reed-Solomon (RS) error correction coding. RS encoding and RS decoding both with and without erasing code symbols are emphasized. There is no need to present rigorous proofs and extreme mathematical detail. Rather, the simple concepts of groups and fields, specifically Galois fields, are presented with a minimum of complexity. Before RS codes are presented, other block codes are presented as a technical introduction into coding. A primitive (15, 9) RS coding example is then completely developed from start to finish, demonstrating the encoding and decoding calculations and a derivation of the famous error-locator polynomial. The objective is to present practical information about Reed-Solomon coding in a manner such that it can be easily understood.},
|
|||
|
|
organization = {NASA},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{computerphile_rs,
|
|||
|
|
author = {Computerphile},
|
|||
|
|
date = {2019-02-20},
|
|||
|
|
title = {Reed Solomon Encoding - Computerphile},
|
|||
|
|
url = {https://www.youtube.com/watch?v=fBRMaEAFLE0},
|
|||
|
|
language = {en},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
@Article{reed_solomon,
|
|||
|
|
author = {Reed, I. S. and Solomon, G.},
|
|||
|
|
date = {1960},
|
|||
|
|
journaltitle = {Journal of the Society for Industrial and Applied Mathematics},
|
|||
|
|
title = {Polynomial Codes Over Certain Finite Fields},
|
|||
|
|
doi = {10.1137/0108018},
|
|||
|
|
eprint = {https://doi.org/10.1137/0108018},
|
|||
|
|
number = {2},
|
|||
|
|
pages = {300-304},
|
|||
|
|
url = {https://doi.org/10.1137/0108018},
|
|||
|
|
volume = {8},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{reed_solomon_wiki,
|
|||
|
|
author = {{Wikipedia Contributors}},
|
|||
|
|
date = {2022},
|
|||
|
|
title = {Reed–Solomon error correction --- {Wikipedia}{,} The Free Encyclopedia},
|
|||
|
|
url = {https://en.wikipedia.org/w/index.php?title=Reed%E2%80%93Solomon_error_correction&oldid=1100051467},
|
|||
|
|
urldate = {2022-08-03},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{kartrak,
|
|||
|
|
author = {{Wikipedia contributors}},
|
|||
|
|
date = {2021},
|
|||
|
|
title = {KarTrak --- {Wikipedia}{,} The Free Encyclopedia},
|
|||
|
|
url = {https://en.wikipedia.org/w/index.php?title=KarTrak&oldid=1037680217},
|
|||
|
|
urldate = {2022-08-15},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{hamming_wiki,
|
|||
|
|
author = {{Wikipedia contributors}},
|
|||
|
|
date = {2022},
|
|||
|
|
title = {Hamming code --- {Wikipedia}{,} The Free Encyclopedia},
|
|||
|
|
url = {https://en.wikipedia.org/w/index.php?title=Hamming_code&oldid=1065900025},
|
|||
|
|
urldate = {2022-08-15},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{nayuki_qr_js,
|
|||
|
|
author = {Nayuki},
|
|||
|
|
date = {2022-08-30},
|
|||
|
|
title = {Nayuki-web-published-code/creating-qr-code-steps.js at dfb110475327271e3b7279a432e2d1a1298815ad · nayuki/Nayuki-web-published-code},
|
|||
|
|
url = {https://github.com/nayuki/Nayuki-web-published-code/blob/dfb110475327271e3b7279a432e2d1a1298815ad/creating-a-qr-code-step-by-step/creating-qr-code-steps.js},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{wiki_chien_search,
|
|||
|
|
author = {{Wikipedia contributors}},
|
|||
|
|
date = {2020},
|
|||
|
|
title = {Chien search --- {Wikipedia}{,} The Free Encyclopedia},
|
|||
|
|
url = {https://en.wikipedia.org/w/index.php?title=Chien_search&oldid=990999150},
|
|||
|
|
urldate = {2022-09-03},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{information_theory,
|
|||
|
|
author = {George Markowsky},
|
|||
|
|
editor = {{Encyclopedia Britannica}},
|
|||
|
|
title = {information theory},
|
|||
|
|
url = {https://www.britannica.com/science/information-theory},
|
|||
|
|
urldate = {2022-09-04},
|
|||
|
|
abstract = {information theory, a mathematical representation of the conditions and parameters affecting the transmission and processing of information. Most closely associated with the work of the American electrical engineer Claude Shannon in the mid-20th century, information theory is chiefly of interest to communication engineers, though some of the concepts have been adopted and used in such fields as psychology and linguistics. Information theory overlaps heavily with communication theory, but it is more oriented toward the fundamental limitations on the processing and communication of information and less oriented toward the detailed operation of particular devices. Interest in the concept of information grew},
|
|||
|
|
langid = {english},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Online{rs_for_coders,
|
|||
|
|
author = {Wikiversity},
|
|||
|
|
date = {2022},
|
|||
|
|
title = {Reed–Solomon codes for coders --- Wikiversity{,}},
|
|||
|
|
url = {https://en.wikiversity.org/w/index.php?title=Reed–Solomon_codes_for_coders&oldid=2387659},
|
|||
|
|
urldate = {2022-04-06},
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
@Comment{jabref-meta: databaseType:biblatex;}
|