Hamming

Results: 262



#Item
1Some Solutions, Homework 4, Statistical Analysis, Spring 2018 Problem 5: (from Rice) Appending three extra (binary) bits to a 4-bit word in a particular way (a Hamming Code) allows detection and correction of up

Some Solutions, Homework 4, Statistical Analysis, Spring 2018 Problem 5: (from Rice) Appending three extra (binary) bits to a 4-bit word in a particular way (a Hamming Code) allows detection and correction of up

Add to Reading List

Source URL: www.ams.jhu.edu

Language: English - Date: 2018-05-29 23:42:47
    2RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK CDAM Research report LSE-CDAMAbstract. We study random subgraphs of the 2-dimensional Hamming graph H

    RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK CDAM Research report LSE-CDAMAbstract. We study random subgraphs of the 2-dimensional Hamming graph H

    Add to Reading List

    Source URL: www.cdam.lse.ac.uk

    Language: English - Date: 2017-04-12 10:30:42
      3CDAM research report LSE-CDAMRANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK Abstract. We study random subgraphs of the 2-dimensional Hamming graph H

      CDAM research report LSE-CDAMRANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK Abstract. We study random subgraphs of the 2-dimensional Hamming graph H

      Add to Reading List

      Source URL: www.cdam.lse.ac.uk

      Language: English - Date: 2017-04-12 10:30:33
        4CDAM research report LSE-CDAMTHE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH MALWINA J. LUCZAK AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i

        CDAM research report LSE-CDAMTHE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH MALWINA J. LUCZAK AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i

        Add to Reading List

        Source URL: www.cdam.lse.ac.uk

        Language: English - Date: 2017-04-12 10:30:41
          5Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai, INDIA

          Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai, INDIA

          Add to Reading List

          Source URL: www.math.iitb.ac.in

          Language: English - Date: 2010-12-08 06:20:50
            6TD : Codes-correcteurs Christophe Ritzenthaler Codes non lin´ eaires 1. Calculer la distance de Hamming entreet).

            TD : Codes-correcteurs Christophe Ritzenthaler Codes non lin´ eaires 1. Calculer la distance de Hamming entreet).

            Add to Reading List

            Source URL: perso.univ-rennes1.fr

            Language: French - Date: 2013-10-08 10:44:34
              7Ahlswede–Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus∗ April 4, 2017 Abstract

              Ahlswede–Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus∗ April 4, 2017 Abstract

              Add to Reading List

              Source URL: www.cs.toronto.edu

              Language: English - Date: 2017-04-20 03:31:17
                8Richard Hamming ``You and Your Research'' Transcription of the Bell Communications Research Colloquium Seminar 7 March 1986 J. F. Kaiser

                Richard Hamming ``You and Your Research'' Transcription of the Bell Communications Research Colloquium Seminar 7 March 1986 J. F. Kaiser

                Add to Reading List

                Source URL: cmp.felk.cvut.cz

                Language: English - Date: 2006-04-25 09:25:53
                  9We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

                  We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

                  Add to Reading List

                  Source URL: vision.soic.indiana.edu

                  Language: English - Date: 2018-04-02 11:03:41
                    10Hamming Distance Metric Learning Mohammad Norouzi† David J. Fleet† Ruslan Salakhutdinov†,‡ †

                    Hamming Distance Metric Learning Mohammad Norouzi† David J. Fleet† Ruslan Salakhutdinov†,‡ †

                    Add to Reading List

                    Source URL: papers.nips.cc

                    - Date: 2015-12-02 15:13:13