Searching for hamming : 5 results found | RSS Feed for this search

18.304 Undergraduate Seminar in Discrete Mathematics (MIT) 18.304 Undergraduate Seminar in Discrete Mathematics (MIT)

Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete math | discrete mathematics | discrete mathematics | discrete | discrete | math | math | mathematics | mathematics | seminar | seminar | presentations | presentations | student presentations | student presentations | oral | oral | communication | communication | stable marriage | stable marriage | dych | dych | emergency | emergency | response vehicles | response vehicles | ambulance | ambulance | game theory | game theory | congruences | congruences | color theorem | color theorem | four color | four color | cake cutting | cake cutting | algorithm | algorithm | RSA | RSA | encryption | encryption | numberical integration | numberical integration | sorting | sorting | post correspondence problem | post correspondence problem | PCP | PCP | ramsey | ramsey | van der waals | van der waals | fibonacci | fibonacci | recursion | recursion | domino | domino | tiling | tiling | towers | towers | hanoi | hanoi | pigeonhole | pigeonhole | principle | principle | matrix | matrix | hamming | hamming | code | code | hat game | hat game | juggling | juggling | zero-knowledge | zero-knowledge | proof | proof | repeated games | repeated games | lewis carroll | lewis carroll | determinants | determinants | infinitude of primes | infinitude of primes | bridges | bridges | konigsberg | konigsberg | koenigsberg | koenigsberg | time series analysis | time series analysis | GARCH | GARCH | rational | rational | recurrence | recurrence | relations | relations | digital | digital | image | image | compression | compression | quantum computing | quantum computing

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.304 Undergraduate Seminar in Discrete Mathematics (MIT) 18.304 Undergraduate Seminar in Discrete Mathematics (MIT)

Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete math | discrete mathematics | discrete mathematics | discrete | discrete | math | math | mathematics | mathematics | seminar | seminar | presentations | presentations | student presentations | student presentations | oral | oral | communication | communication | stable marriage | stable marriage | dych | dych | emergency | emergency | response vehicles | response vehicles | ambulance | ambulance | game theory | game theory | congruences | congruences | color theorem | color theorem | four color | four color | cake cutting | cake cutting | algorithm | algorithm | RSA | RSA | encryption | encryption | numberical integration | numberical integration | sorting | sorting | post correspondence problem | post correspondence problem | PCP | PCP | ramsey | ramsey | van der waals | van der waals | fibonacci | fibonacci | recursion | recursion | domino | domino | tiling | tiling | towers | towers | hanoi | hanoi | pigeonhole | pigeonhole | principle | principle | matrix | matrix | hamming | hamming | code | code | hat game | hat game | juggling | juggling | zero-knowledge | zero-knowledge | proof | proof | repeated games | repeated games | lewis carroll | lewis carroll | determinants | determinants | infinitude of primes | infinitude of primes | bridges | bridges | konigsberg | konigsberg | koenigsberg | koenigsberg | time series analysis | time series analysis | GARCH | GARCH | rational | rational | recurrence | recurrence | relations | relations | digital | digital | image | image | compression | compression | quantum computing | quantum computing

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.310 Principles of Discrete Applied Mathematics (MIT) 18.310 Principles of Discrete Applied Mathematics (MIT)

Description

This course is an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course, and thus includes a writing component. This course is an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course, and thus includes a writing component.

Subjects

probability | probability | probability theory counting | probability theory counting | pigeonhole principle | pigeonhole principle | Van der Waerden's theorem | Van der Waerden's theorem | Chernoff bounds | Chernoff bounds | counting | counting | coding | coding | sampling | sampling | random sampling | random sampling | Catalan families | Catalan families | generating functions | generating functions | chord diagrams | chord diagrams | linear programming | linear programming | simplex method | simplex method | Zero-Sum matrix | Zero-Sum matrix | network flows | network flows | maximum flow problem | maximum flow problem | sorting algorithms | sorting algorithms | QUICKSORT | QUICKSORT | median finding | median finding | sorting networks | sorting networks | Batcher's algorithm | Batcher's algorithm | Euclid's algorithm | Euclid's algorithm | Chinese Remainder Theorem | Chinese Remainder Theorem | cryptography | cryptography | RSA code | RSA code | primaility testing | primaility testing | FFT | FFT | Fast Fourier Transform | Fast Fourier Transform | Shannon's coding theorems | Shannon's coding theorems | Lempel-Ziv codes | Lempel-Ziv codes | linear codes | linear codes | hamming code | hamming code

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.304 Undergraduate Seminar in Discrete Mathematics (MIT)

Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.

Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete mathematics | discrete | math | mathematics | seminar | presentations | student presentations | oral | communication | stable marriage | dych | emergency | response vehicles | ambulance | game theory | congruences | color theorem | four color | cake cutting | algorithm | RSA | encryption | numberical integration | sorting | post correspondence problem | PCP | ramsey | van der waals | fibonacci | recursion | domino | tiling | towers | hanoi | pigeonhole | principle | matrix | hamming | code | hat game | juggling | zero-knowledge | proof | repeated games | lewis carroll | determinants | infinitude of primes | bridges | konigsberg | koenigsberg | time series analysis | GARCH | rational | recurrence | relations | digital | image | compression | quantum computing

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

18.310 Principles of Discrete Applied Mathematics (MIT)

Description

This course is an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course, and thus includes a writing component.

Subjects

probability | probability theory counting | pigeonhole principle | Van der Waerden's theorem | Chernoff bounds | counting | coding | sampling | random sampling | Catalan families | generating functions | chord diagrams | linear programming | simplex method | Zero-Sum matrix | network flows | maximum flow problem | sorting algorithms | QUICKSORT | median finding | sorting networks | Batcher's algorithm | Euclid's algorithm | Chinese Remainder Theorem | cryptography | RSA code | primaility testing | FFT | Fast Fourier Transform | Shannon's coding theorems | Lempel-Ziv codes | linear codes | hamming code

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata