# US 2026/0246481 A1 · Decoding metadata encoded in error correction codes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0246481 A1
- Document ID: US20260246481A1
- Status: Published application
- Kind: A1
- Application number: 19/489,545
- Filed: 2024-04-24
- Published: 2026-08-20
- Earliest claimed: 2023-05-12
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Srikanth DAKSHINAMOORTHY; Majid Anaraki NEMATI; Perry Willmann REMAKLUS, Jr.; Ravinder KUMAR
- Web page: https://patentgrep.com/patent/US20260246481A1

## CPC

- H03M 13/1108: {Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping}
- H03M 13/13: Linear codes
- G06F 11/1048: {using arrangements adapted for a specific error detection or correction feature}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/1134: {Full parallel processing, i.e. all bit nodes or check nodes are processed in parallel}
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/6561: {Parallelized implementations}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments of the present disclosure include techniques for encoding and decoding metadata in error correction codes. During read operation, a decoder generates a first output corresponding to the at least one metadata bit having a first state and a second output corresponding to the at least one metadata bit having a second state. When one of the first and second outputs have a zero value, the decoder sets a value of the at least one metadata bit to the first state or the second state corresponding to the first output or the second output having the zero value. When both the first and second outputs are non-zero, the decoder decodes the codeword with the assumption of both the metadata bit having the first state and the second state to determine if the codeword is correctable with the at least one metadata bit.

## Claims

### Claim 1

A system comprising:
a processor (101);
a memory controller (102); and
a decoder (106), wherein the decoder (106) receives a first codeword comprising first data and an associated first error correction (103) code, the first error correction (103) code comprising a first encoded plurality of bits comprising at least one metadata bit, and the decoder (106) generates a first output corresponding to the at least one metadata bit having a first state and a second output corresponding to the at least one metadata bit having a second state,
wherein when one of the first output or second output have a zero value, setting, by the decoder (106), a value of the at least one metadata bit to the first state or the second state corresponding to the first output or the second output having the zero value, and
when both the first output and the second output are non-zero, decoding the first codeword corresponding to the at least one metadata bit having the first state and decoding the first codeword corresponding to the at least one metadata bit having the second state to determine a value of the at least one metadata bit.

### Claim 2 (depends on 1)

The system of claim 1, wherein the decoder is a Reed-Solomon decoder.

### Claim 3 (depends on 1)

The system of claim 1, wherein the first output corresponds to decoding the first error correction code assuming the at least one metadata bit has the first state and the second output corresponds to decoding the first error correction code assuming the at least one metadata bit has the second state.

### Claim 4 (depends on 1)

The system of claim 1, wherein the decoder successively receives a plurality of second codewords comprising second data and an associated plurality of second error correction codes, the second error correction codes comprising a second encoded plurality of bits comprising the at least one metadata bit.

### Claim 5 (depends on 4)

The system of claim 4, wherein when one of the first output or second output have the zero value for the first codeword, setting, by the decoder, a flag indicating the codeword is correctable with the at least one metadata bit value that has been set for the first error correction code, and
wherein when both the first output and the second output are non-zero for the plurality of second codewords,
decoding, for the plurality of second codewords, based on the first output and the second output to determine the value of the at least one metadata bit when the flag is in a first state, and decoding, for the plurality of second codewords, based on one of the first output or the second output, based on the flag, to determine the value of the at least one metadata bit when the flag is in a second state.

### Claim 6 (depends on 5)

The system of claim 5, wherein, upon determining the value of the at least one metadata bit for each codeword, casting a vote specifying the determined value of the at least one metadata bit, and wherein the first codeword and the plurality of second codewords are decoded when each vote matches.

### Claim 7 (depends on 1)

The system of claim 1, wherein the first output and the second output are generated by decoding the first data and the first error correction code using a syndrome check hardware decoder component.

### Claim 8 (depends on 1)

The system of claim 1, wherein the decoder comprises a first hardware decoder component and a second hardware decoder component, for decoding based on the first output and the second output in parallel.

### Claim 9 (depends on 8)

The system of claim 8, wherein the at least one metadata bit is a single bit.

### Claim 10 (depends on 9)

The system of claim 9, wherein the single bit is a poison bit indicating the associated data contains an error.

### Claim 11 (depends on 1)

The system of claim 1, wherein the decoder receives the first data and the first error correction code parity from a random access memory.

### Claim 12

A decoding method comprising:
receiving, in a decoder, a first codeword comprising first data and an associated first error correction code, the first error correction code comprising a first encoded plurality of bits comprising at least one metadata bit;
generating, by the decoder, a first output corresponding to the at least one metadata bit having a first state;
generating, by the decoder, a second output corresponding to the at least one metadata bit having a second state; and
when one of the first output and second output have a zero value, setting, by the decoder, a value of the at least one metadata bit to the first state or the second state corresponding to the first output or the second output having the zero value, and
when both the first output and the second output are non-zero, decoding the first codeword corresponding to the at least one metadata bit having the first state and decoding the first codeword corresponding to the at least one metadata bit having the second state to determine a value of the at least one metadata bit.

### Claim 13 (depends on 12)

The method of claim 12, wherein the decoder is a Reed-Solomon decoder.

### Claim 14 (depends on 12)

The method of claim 12, wherein the first output corresponds to decoding the first error correction code assuming the at least one metadata bit has the first state and the second output corresponds to decoding the first error correction code assuming the at least one metadata bit has the second state.

### Claim 15 (depends on 12)

The method of claim 12, wherein the decoder successively receives a plurality of second codewords comprising second data and an associated plurality of second error correction codes, the second error correction codes comprising a second encoded plurality of bits comprising the at least one metadata bit.

### Claim 16 (depends on 15)

The method of claim 15, wherein when one of the first output or second output have the zero value for the first codeword, setting, by the decoder, a flag indicating the at least one metadata bit value has been set for the first error correction code, and
wherein when both the first output and the second output are non-zero for the plurality of second codewords,
decoding, for the plurality of second codewords, the first output and the second output to determine the value of the at least one metadata bit when the flag is in a first state and decoding, for the plurality of second codewords, one of the first output or the second output, based on the flag, to determine the value of the at least one metadata bit when the flag is in a second state.

### Claim 17 (depends on 16)

The method of claim 16, wherein, upon determining the value of the at least one metadata bit for each codeword, casting a vote specifying the determined value of the at least one metadata bit, and wherein the first codeword and the plurality of second codewords are decoded when each vote matches.

### Claim 18 (depends on 12)

The method of claim 12, wherein the first output and the second output are generated by decoding the first data and the first error correction code using a syndrome check hardware decoder component.

### Claim 19 (depends on 12)

The method of claim 12, wherein the decoder comprises a first hardware decoder component and a second hardware decoder component, for decoding based on the first output and the second output in parallel.

### Claim 20 (depends on 19)

The method of claim 19, wherein the at least one metadata bit is a single bit.
