Problem 2303. Compute Hamming distances between each pair of rows from two input matrices

• Created by Ryszard Maciol
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Matrix Patterns I

• 18 Problems
• 60 Finishers

Some simple basic problems

• 10 Problems
• 71 Finishers

Like (1)

Difficulty:

(274)

Rate

• Solve Later   
• Add To GroupÂ

For two input matrices u ( n x uCols ) and v ( n x vCols ) of numbers in range [0..255] (8-bit), such that each column represents an (8 x n)-dimensional binary vector, calculate uCols x vCols matrix with each entry (i,j) being a Hamming distance between i -th and j -th column from inputs u and v respectively.

Solve

Solution Stats

73.33% Correct | 26.67% Incorrect

• 30 Solutions
• 15 Solvers

Last Solution submitted on Mar 22, 2023

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers15

Suggested Problems

• Magic!

  297 Solvers

• Sum all integers from 1 to 2^n

  16080 Solvers

• Rotate input square matrix 90 degrees CCW without rot90

  637 Solvers

• interesting center of magic matrix

  108 Solvers

• Create the following sequence : 0 1 1 4 9 25 64 169 ...

  195 Solvers

More from this Author4

• Create a "map" of 2D wavelet coefficients

  3 Solvers

• 1D DCT-II transform.

  19 Solvers

• Compute hamming distance between two binary vectors represented using lists of 1-byte numbers

  39 Solvers

• Rearrange coefficients after block based DCT transform.

  3 Solvers