IP Library Granted Patent US 12,619,578
Granted Patent B2
US 12,619,578 · App. 17/938,828 · Granted May 5, 2026

Encoding / decoding system and method

Inventor: Christopher A. McElveen (Tampa, FL)
Assignee: LogNovations Holdings, LLC
G06F16/1744G06F16/116G06F16/13G06F16/1748G06F21/602G06F21/6245G16H10/60H03M7/3066H03M7/6011H04L1/0056H04L1/0064H04L9/008H04L63/0428H04L67/06H04W4/80H03M7/3088H04L2209/30
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,619,578
App. No.
17/938,828
Granted
May 5, 2026
Kind
B2
Abstract

A computer-implemented method, computer program product and computing system for: encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file; receiving a request to manipulate the unencoded data file; and processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

Claims (66)

1 . A computer-implemented method, executed on a computing device comprising: encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file, wherein the dictionary file includes a binary sequence of all possible combinations of a number having a defined bit length, wherein the defined bit length is determined based upon design criteria of encoding process, and wherein each of the plurality of mappings includes a starting location as a bit-wise offset within the dictionary file and a length as a number of bits within the dictionary file beginning from the starting location within the dictionary file; receiving a request to manipulate the unencoded data file; and processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

2 . The computer-implemented method of claim 1 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes one or more of:

performing a homomorphic encoding operation; and

performing a heteromorphic encoding operation.

3 . The computer-implemented method of claim 1 wherein encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file includes one or more of:

compressing an unencoded data file to generate a related encoded data file; and

encrypting an unencoded data file to generate a related encoded data file.

4 . The computer-implemented method of claim 1 wherein the dictionary file includes a plurality of discrete entries.

5 . The computer-implemented method of claim 4 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a byte-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

6 . The computer-implemented method of claim 1 wherein the dictionary file includes a plurality of concatenated entries.

7 . The computer-implemented method of claim 6 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a bit-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

8 . The computer-implemented method of claim 1 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, utilizing a sampling window, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

9 . The computer-implemented method of claim 1 wherein the requested manipulations concern one or more of:

a computation operation;

a search operation;

an append operation;

a splitting operation;

a joining operation; and

a concatenating operation.

10 . A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising: encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file, wherein the dictionary file includes a binary sequence of all possible combinations of a number having a defined bit length, wherein the defined bit length is determined based upon design criteria of encoding process, and wherein each of the plurality of mappings includes a starting location as a bit-wise offset within the dictionary file and a length as a number of bits within the dictionary file beginning from the starting location within the dictionary file; receiving a request to manipulate the unencoded data file; and processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

11 . The computer program product residing on a non-transitory computer readable medium of claim 10 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes one or more of:

performing a homomorphic encoding operation; and

performing a heteromorphic encoding operation.

12 . The computer program product residing on a non-transitory computer readable medium f claim 10 wherein encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file includes one or more of:

compressing an unencoded data file to generate a related encoded data file; and

encrypting an unencoded data file to generate a related encoded data file.

13 . The computer program product residing on a non-transitory computer readable medium of claim 10 wherein the dictionary file includes a plurality of discrete entries.

14 . The computer program product residing on a non-transitory computer readable medium of claim 13 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a byte-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

15 . The computer program product residing on a non-transitory computer readable medium of claim 10 wherein the dictionary file includes a plurality of concatenated entries.

16 . The computer program product residing on a non-transitory computer readable medium of claim 15 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a bit-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

17 . The computer program product residing on a non-transitory computer readable medium of claim 10 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, utilizing a sampling window, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

18 . The computer program product residing on a non-transitory computer readable medium of claim 10 wherein the requested manipulations concern one or more of:

a computation operation;

a search operation;

an append operation;

a splitting operation;

a joining operation; and

a concatenating operation.

19 . A computing system including a processor and memory configured to perform operations comprising: encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file, wherein the dictionary file includes a binary sequence of all possible combinations of a number having a defined bit length, wherein this defined bit length is determined based upon design criteria of encoding process, and wherein each of the plurality of mappings includes a starting location as a bit-wise offset within the dictionary file and a length as a number of bits within the dictionary file beginning from the starting location within the dictionary file; receiving a request to manipulate the unencoded data file; and processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

20 . The computing system of claim 19 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

performing a homomorphic encoding operation; and

performing a heteromorphic encoding operation.

21 . The computing system of claim 19 wherein encoding an unencoded data file to generate a related encoded data file based, at least in part, upon a plurality of mappings to a plurality of portions of a dictionary file includes one or more of:

compressing an unencoded data file to generate a related encoded data file; and

encrypting an unencoded data file to generate a related encoded data file.

22 . The computing system of claim 19 wherein the dictionary file includes a plurality of discrete entries.

23 . The computing system of claim 22 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a byte-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

24 . The computing system of claim 19 wherein the dictionary file includes a plurality of concatenated entries.

25 . The computing system of claim 24 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, in a bit-wise fashion, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

26 . The computing system of claim 19 wherein processing the related encoded data file based, at least in part, upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file includes:

processing the related encoded data file, utilizing a sampling window, based upon the plurality of mappings and the dictionary file to generate a modified encoded data file that represents the requested manipulations of the unencoded data file.

27 . The computing system of claim 19 wherein the requested manipulations concern one or more of:

a computation operation;

a search operation;

an append operation;

a splitting operation;

a joining operation; and

a concatenating operation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 3, 2023
From: MCELVEEN, CHRISTOPHER A.
To: LOGNOVATIONS HOLDINGS, LLC
Reel/Frame 065110/0405 →
Continuity (3)
Provisional Application 63272539 · Oct 27, 2021
Provisional Application 63256267 · Oct 15, 2021
Related Publication 20230122442A1 · Apr 20, 2023
References Cited (174)
US 5838963A · Griffiths · 1998 [cited by applicant]
US 5956724A · Griffiths · 1999 [cited by applicant]
US 6272658B1 · Steele · 2001 [cited by examiner]
US 6389427B1 · Faulkner · 2002 [cited by examiner]
US 6597812B1 · Fallon · 2003 [cited by applicant]
US 7102552B1 · Archbold · 2006 [cited by applicant]
US 7756817B2 · Merchia et al. · 2010 [cited by applicant]
US 7783781B1 · Rothstein · 2010 [cited by applicant]
US 7814316B1 · Hughes · 2010 [cited by applicant]
US 7868789B1 · Binnig et al. · 2011 [cited by applicant]
US 8045224B2 · Arai · 2011 [cited by applicant]
US 8832034B1 · Ramarao · 2014 [cited by applicant]
US 8847797B1 · Barr · 2014 [cited by applicant]
US 9094378B1 · Yung · 2015 [cited by examiner]
US 9914889B2 · Hoehn · 2018 [cited by applicant]
US 9928559B2 · Lahmi · 2018 [cited by applicant]
US 9984255B2 · Shah · 2018 [cited by applicant]
US 10284527B2 · Garcia · 2019 [cited by applicant]
US 10977127B1 · Resch · 2021 [cited by applicant]
US 11783922B1 · Tong · 2023 [cited by applicant]
US 20030028509A1 · Sah · 2003 [cited by applicant]
US 20040022312A1 · Jones · 2004 [cited by examiner]
US 20060259949A1 · Schaefer · 2006 [cited by applicant]
US 20070008191A1 · Archbold et al. · 2007 [cited by applicant]
US 20070116055A1 · Atsumi et al. · 2007 [cited by applicant]
US 20080120608A1 · Shetty · 2008 [cited by applicant]
US 20080204284A1 · Archbold et al. · 2008 [cited by applicant]
US 20080294909A1 · Ostrovsky et al. · 2008 [cited by applicant]
US 20090002207A1 · Harada · 2009 [cited by applicant]
US 20090060047A1 · Schneider · 2009 [cited by applicant]
US 20090178144A1 · Redlich · 2009 [cited by applicant]
US 20100122312A1 · Green et al. · 2010 [cited by applicant]
US 20110191588A1 · Rogaway · 2011 [cited by applicant]
US 20120030375A1 · Schulenburg · 2012 [cited by applicant]
US 20120069849A1 · Golechha · 2012 [cited by applicant]
US 20120194361A1 · Archbold et al. · 2012 [cited by applicant]
US 20130036101A1 · Marwah et al. · 2013 [cited by applicant]
US 20130067237A1 · Huang et al. · 2013 [cited by applicant]
US 20130275391A1 · Batwara · 2013 [cited by applicant]
US 20140095768A1 · Kipnis · 2014 [cited by examiner]
US 20140304505A1 · Dawson · 2014 [cited by applicant]
US 20140372470A1 · Attaluri · 2014 [cited by examiner]
US 20150025909A1 · Hayter, II · 2015 [cited by applicant]
US 20150039320A1 · Neuhauser · 2015 [cited by applicant]
US 20150244517A1 · Nita · 2015 [cited by examiner]
US 20150269180A1 · Chen · 2015 [cited by applicant]
US 20160105402A1 · Soon-Shiong et al. · 2016 [cited by applicant]
US 20160154963A1 · Kumar et al. · 2016 [cited by applicant]
US 20170026656A1 · Aerts et al. · 2017 [cited by applicant]
US 20170061138A1 · Lambert · 2017 [cited by applicant]
US 20170212909A1 · Bakashi et al. · 2017 [cited by applicant]
US 20170286221A1 · Azogui et al. · 2017 [cited by applicant]
US 20170288694A1 · Kataoka · 2017 [cited by applicant]
US 20170364450A1 · Struttmann · 2017 [cited by applicant]
US 20180067978A1 · Matsuura · 2018 [cited by applicant]
US 20180069696A1 · Yoo et al. · 2018 [cited by applicant]
US 20180212750A1 · Hoffstein et al. · 2018 [cited by applicant]
US 20180287629A1 · Nakatsu et al. · 2018 [cited by applicant]
US 20180349740A1 · Schneider et al. · 2018 [cited by applicant]
US 20190058580A1 · Tormasov et al. · 2019 [cited by applicant]
US 20190065517A1 · Comertoglu et al. · 2019 [cited by applicant]
US 20190129640A1 · Riahi · 2019 [cited by examiner]
US 20190138927A1 · Jeffries · 2019 [cited by applicant]
US 20200110767A1 · Alakuijala et al. · 2020 [cited by applicant]
US 20200110830A1 · Chen · 2020 [cited by applicant]
US 20200175178A1 · Li et al. · 2020 [cited by applicant]
US 20200228308A1 · Shainski · 2020 [cited by applicant]
US 20200349741A1 · Hinnerson · 2020 [cited by examiner]
US 20210073221A1 · Chavan · 2021 [cited by examiner]
US 20210149825A1 · Durham · 2021 [cited by applicant]
US 20210288662A1 · Fukazawa et al. · 2021 [cited by applicant]
US 20210334412A1 · Kalaboukis et al. · 2021 [cited by applicant]
US 20210375008A1 · Hassan · 2021 [cited by examiner]
US 20220059094A1 · Thomson · 2022 [cited by examiner]
US 20220191034A1 · Adams, III · 2022 [cited by applicant]
US 20220405461A1 · Lempel et al. · 2022 [cited by applicant]
US 20230064804A1 · Tariyal · 2023 [cited by applicant]
US 20230064842A1 · Huang · 2023 [cited by applicant]
US 20230064844A1 · Chen · 2023 [cited by applicant]
US 20230064846A1 · Morioka · 2023 [cited by applicant]
US 20230064848A1 · Carrillo · 2023 [cited by applicant]
US 20230064852A1 · Bian · 2023 [cited by applicant]
US 20230064855A1 · Sakalkar · 2023 [cited by applicant]
US 20230064862A1 · Lu · 2023 [cited by applicant]
US 20230064865A1 · Fukatsu · 2023 [cited by applicant]
US 20230119765A1 · McElveen · 2023 [cited by examiner]
US 20230122581A1 · McElveen · 2023 [cited by applicant]
US 20240064349A1 · Ouedraogo · 2024 [cited by applicant]
CN 106407285 · 2017 [cited by applicant]
JP 02301873 · 1990 [cited by applicant]
JP 05011973 · 1993 [cited by applicant]
JP H6222903A1 · 1994 [cited by applicant]
JP 07135471 · 1995 [cited by applicant]
JP 08163179 · 1996 [cited by applicant]
JP 2002507771 · 2002 [cited by applicant]
JP 2018041288 · 2018 [cited by applicant]
JP 2018180645 · 2018 [cited by applicant]
JP 2021145281 · 2021 [cited by applicant]
WO 9914889 · 1999 [cited by applicant]
WO 1999048006A1 · 1999 [cited by applicant]
WO 2018102861 · 2018 [cited by applicant]
WO 2018102861A1 · 2018 [cited by applicant]
WO 2020110830A1 · 2020 [cited by applicant]
WO 2020110830 · 2020 [cited by applicant]
WO 20210058229 · 2021 [cited by applicant]
WO 2023064804 · 2023 [cited by applicant]
WO 2023064804A1 · 2023 [cited by applicant]
WO 2023064842 · 2023 [cited by applicant]
WO 2023064842A1 · 2023 [cited by applicant]
WO 2023064844 · 2023 [cited by applicant]
WO 2023064844A1 · 2023 [cited by applicant]
WO 2023064846 · 2023 [cited by applicant]
WO 2023064846A1 · 2023 [cited by applicant]
WO 2023064848 · 2023 [cited by applicant]
WO 2023064848A1 · 2023 [cited by applicant]
WO 2023064852 · 2023 [cited by applicant]
WO 2023064852A1 · 2023 [cited by applicant]
WO 2023064855 · 2023 [cited by applicant]
WO 2023064855A1 · 2023 [cited by applicant]
WO 2023064862 · 2023 [cited by applicant]
WO 2023064862A1 · 2023 [cited by applicant]
WO 2023064865 · 2023 [cited by applicant]
WO 2023064865A1 · 2023 [cited by applicant]
Naoki Katoh et al., “Sublinear Computation Paradigm, Algorithmic Revolution in the Big Data Era.” Published by the registered company Springer Nature Singapore Pte Ltd. 2022. https://doi.org/10.1007/978-981-16-4095-7. p… [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,213 on Mar. 31, 2023. [cited by applicant]
Final Office Action issued in related U.S. Appl. No. 18/045,213 on Nov. 1, 2023. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 17/938,836 on Nov. 9, 2023 [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077965 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077989 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077993 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077995 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077996 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077997 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077998 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078026 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078032 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078039 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078044 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078055 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078058 on Jan. 17, 2023. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 17/938,849 on issue Date; Feb. 15, 2024. [cited by applicant]
Final Office Action issued in related U.S. Appl. No. 17/938,836 on issue Date; Apr. 19, 2024. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 17/938,819 on Jun. 25, 2024. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 17/938,847 on Jun. 21, 2024. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,213 on issue Date; Apr. 24, 2024. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,220 on issue Date; Mar. 26, 2024. [cited by applicant]
Notice of Allowance issued in related U.S. Appl. No. 18/045,224 on issue Date May 14, 2024. [cited by applicant]
Notice of Allowance issued in related U.S. Appl. No. 18/045,224 on issue Date; Mar. 27, 2024. [cited by applicant]
Notice of Allowance issued in related U.S. Appl. No. 18/045,246 on issue Date: May 14, 2024. [cited by applicant]
Notice of Allowance issued in related U.S. Appl. No. 18/045,246 on issue Date; Mar. 27, 2024. [cited by applicant]
Notice of Allowance issued in related U.S. Appl. No. 18/045,246 on Jun. 21, 2024. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,224 on Oct. 13, 2023. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,222 on Oct. 24, 2023. [cited by applicant]
Non-Final Office Action issued in related U.S. Appl. No. 18/045,246 on Oct. 24, 2023. [cited by applicant]
JPO, “Office Action,” regarding Application No. 2024-522181, 6 pages, dated May 13, 2025. [cited by applicant]
Kato, M., “Basic Cryptograph I,” Science Press, pp. 264, 325, 3 pages, dated Sep. 25, 1989. [cited by applicant]
JPO, “Office Action,” regarding Application No. 2024-522180,3 pages, dated May 13, 2025. [cited by applicant]
JPO, “Office Action,” regarding Application No. 2024-522179, 2 pages, dated May 13, 2025. [cited by applicant]
Coveroth, EL15: What is Homomorphic Encryption, https://www.reddit.com/r/explainlikeimfive/comments/5qea0u/eli5_what_is_homomorphic_encryption, Jan. 27, 2017 (Year: 2017). [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077991 on Jan. 10, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078024 on Jan. 10, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/077961 on Jan. 17, 2023. [cited by applicant]
International Search Report and Written Opinion issued in related Application Serial No. PCT/US2022/078022 on Jan. 10, 2023. [cited by applicant]
https://help.sap.com/doc/eb75509ab0fd1014a2c6ba9b6d252832/2.0.04/en-US/SAP_HANA_Administration_Guide_en.pdf; Oct. 31, 2019. [cited by applicant]
Binning C. et al: “Dictionary-based order-preserving string compression for main memory column stores”, SIGMOD-PODS '09, ACM, Jun. 29, 2009 (Jun. 29, 2009, p. 283-296, XP058221485, doi: 10.1145/1559845.1559877. [cited by applicant]
Binning C. et al: “Dictionary-basd order-preserving string compression for main memory column stores”, SIGMOD-PODS '09, ACM, Jun. 29, 2009 (Jun. 29, 2009), p. 283-296, XP058221485, doi: 10.1145/1559845.1559877 XP0582214… [cited by applicant]
JPO, “Office Action,” regarding Application No. 2024-522179, 2 pages, dated Nov. 11, 2025. [cited by applicant]
JPO, “Office Action,” regarding Application No. 2024-522180, 2 pages, dated Nov. 11, 2025. [cited by applicant]
Ferreira A. et al: “Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays”, Arxiv.org, Corness University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Dec. 30, 2009 (Dec. 30, 2009), XP08… [cited by applicant]
EPO, extendd European search report regarding Application No. 22881990.0, 8 pages, dated Sep. 24, 2025. [cited by applicant]
EPO, extended European search report regarding Application No. 22881994.2, 8 pages, dated Sep. 30, 2025. [cited by applicant]
EPO, extended European search report regarding Application No. 22882007.2, 8 pages, dated Sep. 30, 2025. [cited by applicant]
EPO, extended European search report regarding Application No. 22882009.8, 8 pages, dated Jun. 10, 2025. [cited by applicant]
EPO, extended European search report regarding Application No. 22882012.2, 8 pages, dated Jun. 10, 2025. [cited by applicant]