Outer coding framework

1. A method comprising:

receiving link-layer packets, a first portion of the received link-layer packets appended with a cyclic redundancy check and a second portion of the received link-layer packets not appended with a cyclic redundancy check;

inserting the received link-layer packets into one or more columns of one or more frames, the first portion of the received link-layer packets having the appended cyclic redundancy check removed before insertion into the frame;

decoding, using an outer code, one or more rows of the one or more frames; and

reading the one or more rows of the frame, when the one or more rows are decoded using the outer code, the one or more rows of the one or more frames forming an application data packet.

2. The method of claim 1 further comprising:

receiving the first portion of packets as a first substream of packets; and

receiving the second portion of packets as a second substream of packets, the first substream of packets having a higher priority than the second substream of packets.

3. The method of claim 1 , wherein inserting further comprises:

inserting the received link-layer packets into the one or more frames each configured as a Reed-Solomon table.

4. The method of claim 1 , wherein decoding further comprises:

decoding the received link-layer packets using an inner code.

5. The method of claim 1 further comprising:

receiving, as the first portion of the received link-layer packets appended with the cyclic redundancy check, hybrid automatic retransmission request (HARQ) protocol data units.

6. A method comprising:

determining, based on a cyclic redundancy check, a first erasure table including zero or more erasures;

determining a second erasure table;

using the first erasure table to locate errors in a frame of packets, when the zero or more erasures of the first erasure table do not exceed a threshold of erasures;

using the second erasure table to locate errors in the frame of packets, when the zero or more erasures of the first erasure table do exceed the threshold of erasures, wherein the second erasure table is not used to locate errors in a codeword in the frame of packets when the second erasure table comprises a plurality of erasures in the codeword exceeding a second threshold; and

decoding the codeword in the frame of packets without using erasure information when the threshold and the second threshold are exceeded.

7. A method comprising:

determining, based on a cyclic redundancy check, a first erasure table including zero or more erasures;

determining a second erasure table;

using the first erasure table to locate errors in a frame of packets, when the zero or more erasures of the first erasure table do not exceed a threshold of erasures;

using the second erasure table to locate errors in the frame of packets, when the zero or more erasures of the first erasure table do exceed the threshold of erasures; the method further comprising:

decoding at least one codeword in the frame of packets using the second erasure table to provide at least one decoded codeword;

determining whether the at least one decoded codeword is in error; and

decoding the at least one codeword in the frame of packets without using erasure information based on the determining whether the at least one decoded codeword is in error.

8. A method comprising:

determining, based on a cyclic redundancy check, a first erasure table including zero or more erasures;

determining a second erasure table;

using the first erasure table to locate errors in a frame of packets, when the zero or more erasures of the first erasure table do not exceed a threshold of erasures;

using the second erasure table to locate errors in the frame of packets, when the zero or more erasures of the first erasure table do exceed the threshold of erasures; the method further comprising:

receiving the frame of packets appended with a cyclic redundancy check, the cyclic redundancy check used to determine erasures for the first erasure table;

inserting the received frame of packets into one or more columns of the frame of packets;

decoding, using an outer code, one or more rows of the frame of packets; and

reading a portion of the frame of packets, when the one or more rows are decoded using the outer code, the portion inserted into an application data table.

9. The method of claim 8 , further comprising:

inserting link-layer packets into the frame of packets, the frame configured as a Reed-Solomon table, the link-layer packets received, at the client station, without an appended cyclic redundancy check.