What error correction algorithm to choose for a two-dimensional barcode?

Question

Programming

There is a simple two-dimensional barcode 5x5 cells, 16 bits for data and 9, respectively, remain.
Question: is it possible to fit data for error correction into the remaining 9 bits, or only a checksum and what algorithm would you recommend?
Update:
I need to determine the orientation of the code when trying to do this, sequentially for four positions, expecting the correction code to converge only for the correct one. Or give 4 bits for orientation (just by fixing them), and the remaining 5 for the checksum? It is more important for me to exclude misrecognitions than to correct errors.

Answer 1

It seems to me, or the usual parity on rows and columns (4 check bits in the last column + 4 check bits in the last line) will allow you to correct any single error? (it will be at the intersection of the row and column with corrupted parities; and the corruption in the check bits will be determined by the absence of violations in the other dimension).
Well, you can probably extract something useful from the 9th bit ...

Answer 2

Standard Hamming Code , in your case option (31, 26) - 26 data bits, 5 control bits. Repairs single errors and detects double errors.

Answer 3

Reed-Solomon codes :)