feat: Hamming Code for 32bit values #1431

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,29 @@
	/**
	* github author: chrdek
	* license: GPL-3.0 or later
	*
	* @param {number} b
	*
	* The following code generates the hamming code for
	* 32-bit integer values (incl. parity bit check)
	*
	**/

	function HammingCode(b) {
	var bytes = new Array(65536);
	const bitAlloc = (bin) => {
	var cnt = 0;
	while (bin > 0) {
	cnt += bin & 1;
	bin >>=1;
	}
	return cnt;
	} //end of bitallocation

	for (var k=0; k < 65536; k++) bytes[k] = bitAlloc(k);

	//perform leftmost shifting for integer value
	return bytes[b & 0xFFFF] + bytes[b >> 16];
	}

	export { HammingCode }

41 changes: 41 additions & 0 deletions Bit-Manipulation/test/HammingCode.test.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,41 @@
	import { HammingCode } from '../HammingCode'

	test('checks HammingCode of 1110101 hex converted is 5', () => {
	let code = HammingCode(parseInt("1110101",16))
	expect(code).toBe(5)
	})

	test('checks HammingCode of 10043091 hex converted is 7', () => {
	let code = HammingCode(parseInt("10043091",16))
	expect(code).toBe(7)
	})

	test('checks HammingCode of 889193 hex converted is 9', () => {
	let code = HammingCode(parseInt("889193",16))
	expect(code).toBe(9)
	})

	test('checks HammingCode of 1110101 hex converted is 5', () => {
	let code = HammingCode(parseInt("1101110",2))
	expect(code).toBe(5)
	})

	test('checks HammingCode of 1101110 is 5', () => {
	let code = HammingCode(1101110)
	expect(code).toBe(5)
	})

	test('checks HammingCode of 0x10043091 is 7', () => {
	let code = HammingCode(0x10043091)
	expect(code).toBe(7)
	})

	test('checks HammingCode of 0x8891930311 is NaN (above range)', () => {
	let code = HammingCode(0x8891930311)
	expect(code).toBeNaN()
	})

	test('checks HammingCode of the Number 100 is 3', () => {
	let code = HammingCode((Number(100))
	expect(code).toBe(3)
	})

Navigation Menu