An Efficient Parity Checking Scheme for Random and Burst Errors

DOI10.1109/TCOM.1976.1093269MaRDI QIDQ4115091zbMATH OpenOpenAlexFDO

Authors B. R. Narayana Murthy

Publication date 1976

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1976.1093269

Mathematics Subject Classification ID

Communication theory (94A05) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(1)

• Lower bounds based on linear programming for the quadratic assignment problem

This page was built for publication: An Efficient Parity Checking Scheme for Random and Burst Errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4115091)