CHI TIẾT NGHIÊN CỨU …

Tiêu đề

Enhancing undergraduate mathematics curriculum via coding theory and cryptography

Tác giả

Aydin N.

Năm xuất bản

2009

Source title

PRIMUS

Số trích dẫn

DOI

10.1080/10511970701590627

Liên kết

https://www.scopus.com/inward/record.uri?eid=2-s2.0-75349086510&doi=10.1080%2f10511970701590627&partnerID=40&md5=a6faae39aaad7a62e1513d949f11f5fe

Tóm tắt

The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the basics of the subjects to undergraduates without requiring a lot of prerequisite knowledge, and at the same time connect several different areas of mathematics and computer science. Moreover, these are branches of mathematics suitable for undergraduate research. In this article, I will describe how I taught a special topics course on coding theory and cryptography, in a non-traditional way, at a small liberal arts college, the pedagogical aspects and the results and implications of the course. © Taylor & Francis Group, LLC.

Từ khóa

Coding theory; Cryptography; Innovative teaching; Motivation; Technology; Undergraduate curriculum; Undergraduate research

Tài liệu tham khảo

Asamov T., Aydin N., LDPC codes of arbitrary girth, Canadian Workshop On Information Theory, pp. 69-72, (2007); Asamov T., Aydin N., A search algorithm for linear codes, Designs, Codes and Cryptography, 45, 2, pp. 213-217, (2007); Aydin N., Asamov T., Gulliver T.A., Some open problems on quasi-twisted and related code constructions and good quaternary codes, Proceedings of International Symposium On Information Theory, pp. 856-860, (2007); Bernstein M., The hat problem and Hamming Codes, Focus, 21, 8, pp. 4-6, (2001); Boneh D., Twenty years of attacks on the RSA cryptosystems, Notices of The American Mathematical Society, 46, 2, pp. 203-213, (1999); Diffie W., Hellman M.E., New directions in cryptography, Ieee Transactions On Information Theory, 22 IT, 6, pp. 644-654, (1976); Golay M.J.E., Notes on digital coding, Proc. IRE, 37, (1949); Hamming R.W., Error-detecting and error-correcting codes, Bell System Technical Journal, 29, pp. 147-160, (1950); Hankerson D.R., Hoffman D.G., Leonard D.A., Lindner C.C., Phelps K.T., Rodger C.A., Wall J.R., Coding Theory and Cryptography: The Essentials, (2000); High Performance Software For Algebra, Number Theory and Geometry; Morgan S.P., Richard Wesley Hamming (1915-1998), Notices of The American Mathematical Society, 45, 8, pp. 972-977, (1998); Pless V., Introduction to The Theory of Error-correcting Codes, (1998); Richardson T.J., Shokrollahi M.A., Urbanke R.L., Design of capacity-approaching irregular low-density parity-check codes, Ieee Transactions On Information Theory, 47, 2, pp. 619-637, (2001); Rivest R.L., Shamir A., Adleman L., A method for obtaining digital signatures and public key cryptosystems, Communications of The Acm, 21, 2, pp. 120-126, (1978); Robinson S., Why Mathematicians now care about their hat color, The New York Times, (2001); Shannon C.E., A mathematical theory of communication, Bell System Technical Journal, 27, (1948); Shetter W.Z., This Essay is Redundant, (2000); Trappe W., Washington L.C., Introduction to Cryptography With Coding Theory, (2002)