US 12,355,567 B2
Efficient large object transport
Paul Peyla, Elkridge, MD (US); Brian W. Kroeger, Sykesville, MD (US); and Gadiel Seroussi, Cupertino, CA (US)
Assigned to iBiquity Digital Corporation, Columbia, MD (US)
Filed by iBiquity Digital Corporation, Columbia, MD (US)
Filed on Jul. 19, 2023, as Appl. No. 18/223,802.
Application 18/223,802 is a continuation of application No. PCT/US2021/014620, filed on Jan. 22, 2021.
Prior Publication US 2023/0361915 A1, Nov. 9, 2023
Int. Cl. H04L 1/00 (2006.01)
CPC H04L 1/0071 (2013.01) [H04L 1/0057 (2013.01)] 30 Claims
OG exemplary drawing
 
1. A method comprising:
partitioning a data object into a plurality of nested data objects, wherein each nested data object of the plurality of nested data objects is partitioned into a predefined number of fragments, each fragment having K symbols;
processing each nested data object to produce sequences of coded payloads corresponding to each nested data object, the processing including, for each nested data object:
using (n, K) coding for which n>K, individually coding the fragments of the nested data object into codewords with n codeword symbols per codeword; and
generating, from the codewords, a sequence of coded payloads that are unique for the nested data object, wherein the sequence of the coded payloads is ordered by a codeword symbol position and then by a nested data object identifier according to a rule; and
transmitting coded payloads of the sequences of coded payloads.