Eureka on the web
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →A data-backed look at multi-level cell programming algorithm patents for flash memory: who leads filings, how the technology is classified across IPC subclasses, and where filing activity is heading.
Filing growth = 2021 (24 records) → 2024 (12); 2024 is the last year we treat as complete. Top-5 share = the 5 largest assignees ÷ all 1,026 records in scope (CR5), not the ranked leaders only.
Multi-level cell (MLC) and triple-level cell (TLC) programming algorithms govern how flash memory controllers write multiple bits per cell — determining program/erase cycling, page ordering, and error margins. This landscape draws on 1,026 published records filed or published between 2015 and 2026, all matched on the combination of MLC/TLC terminology, programming, and flash. The scope spans core cell-array and controller patents as well as adjacent digital-processing and error-coding filings that touch the same programming routines.
Filing activity here traces back well before the current search window, with a filing peak already in 2008 and a long tail of activity since. Because publication typically lags filing by around 18 months, the most recent one to two years in any chart will understate real filing volume and should not be read as a slowdown on their own.
The two views below cover the same 1,026 records: one tracks filing activity by year, the other breaks the corpus down by IPC subclass. Read them together — filing volume tells you when a wave of activity happened, and the IPC split tells you where the claims actually sit.
Filings ran as high as 80 in 2008, prior to the current search window opening, and the field has not returned to that level since. The complete-year comparison from 2021 (24) to 2024 (12) shows a 50% drop over that three-year span; 2025 and 2026 figures are still filling in and should be read with that lag in mind.
Publication lags filing by roughly 18 months, so 2025 onwards are still filling in. Growth rates on this page therefore end at 2024; running them to the last bar would understate the field.
G11C (static and digital memories) covers 73.4% of the 1,026 records, and G06F (electric digital data processing) covers 41.6% — together these two classes account for the bulk of claim activity. Everything else, from coding schemes (H03M) to memory device manufacture (H10B) and general semiconductor devices (H10D, H01L), sits at or below 3% of records, marking those as comparatively open branches rather than core battlegrounds.
Shares are the percentage of the 1,026 records in scope. A patent can carry several IPC classes, so the shares add up to more than 100%.
This page is one run against one query. Ask Eureka your own question about multi-level cell programming algorithm for flash memory patent landscape and every answer comes back with the patent numbers behind it.
Try EurekaA method and system to improve the performance of a multi-level cell (MLC) NAND flash memory. In one embodiment, metadata associated with stored data is kept only in the lower pages of the MLC NAND flash memory, which program faster than upper pages. By confining metadata to the low-latency pages, the quality of service of the MLC NAND flash memory can be improved.Filed by Intel NDTM US LLC, published 2011-02-03 as US20110029718A1.


When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →When it has to run inside your own pipeline.
Patent search, landscape analysis and assignee resolution as MCP tools. Drop them into any agent framework, or call REST directly.
Browse MCP servers →Four figures worth checking before scoping freedom-to-operate work or a new filing strategy in this space.
Five companies combine for 506 of the 1,026 records in scope, and the top ten extend that to 686 records, or 66.9% of the field. That is a narrow ownership base for a topic this broad — expect dense prior art from a small set of repeat filers rather than a wide field of independent entrants.
The field's highest filing year, 80 in 2008, predates this dataset's search window. Within the current window, the last complete three-year comparison shows filings roughly halving. Treat 2025 and 2026 counts as provisional given typical publication lag.
G11C alone touches nearly three-quarters of records, with G06F a distant second at 41.6%. The remaining classes, from coding conversion to device manufacture, each sit under 3% of records — thin coverage that can mean either low relevance or an under-claimed adjacency worth checking.
The United States accounts for 700 of the tracked records, well ahead of South Korea (86), WIPO/PCT (60), Europe (54), China (45) and Taiwan (30). A strategy built only around US filings would miss a meaningful share of activity routed through PCT and Korean filings.
Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to multi-level cell programming algorithm for flash memory patent landscape, with the prior art for and against each one.
The figures above frame the field at a high level. Turning them into a filing or freedom-to-operate decision means digging into specific claim language and the entities that hold it.
With 49.3% of records held by five assignees, start any freedom-to-operate check against their granted claims before looking at the long tail.
Explore assignee claim coverage in EurekaClasses like H03M and H10B sit under 3% of records each — worth a closer read to see if that reflects low relevance or open space for a new filing.
Run a white space search in Eureka2025 and 2026 counts will keep rising as filings publish. Set up monitoring rather than relying on a single snapshot of the trend.
Set up filing alerts in EurekaThe dataset's assignee ranking is concentrated: the top five companies together account for 506 of the 1,026 records in scope, or 49.3% of the field, and the top ten extend that to 66.9%. The leader alone holds 170 records, well ahead of the fifth-ranked company at 68 and the tenth-ranked at 19. This is a field dominated by a handful of established memory and controller makers rather than a broad spread of independent filers, so any competitive review should start with those leaders' granted claims.
No — filing activity peaked well before the current search window, at 80 filings in 2008, and has trended down since. Using the most recent complete-year comparison available, filings fell 50% from 24 in 2021 to 12 in 2024. Note that 2025 and 2026 figures in any dataset will look artificially low because publication typically lags actual filing by around 18 months, so those years should not be read as confirming further decline.
G11C, covering static and digital memories, is the dominant classification at 73.4% of the 1,026 records in scope, followed by G06F for electric digital data processing at 41.6%. Smaller but still relevant classes include H03M (coding and code conversion), H10B (memory device manufacture), H10D and H01L (semiconductor devices), each under 3% of records. Because a single patent can carry multiple IPC codes, these shares add up to more than 100% and should be read as coverage rates, not a partition of the field.
US20110029718A1, filed by Intel NDTM US LLC and published in 2011, covers a method of confining metadata storage to the faster-programming lower pages of an MLC NAND flash device, specifically to improve quality of service. It does not claim MLC programming broadly — its scope is the specific technique of segregating metadata by page latency tier. Designs that store metadata differently, or that do not rely on a lower/upper page latency asymmetry, sit outside its claims, though a full freedom-to-operate check should compare exact claim language against your implementation.
The IPC composition points to several thinner branches: H03M (coding and code conversion), H10B (memory device manufacture), H10D, H01L and G07C each cover 3% or less of the 1,026 records in scope, compared with 73.4% for the dominant G11C class. That gap does not guarantee an easy filing, but it does suggest programming-adjacent coding schemes and manufacturing-process claims are less contested than core cell-array and controller architecture claims held by the ranked leaders. Any new filing strategy should combine this with a direct claims read of the leading assignees before committing scope.
Go past this page: query the whole multi-level cell programming algorithm for flash memory patent landscape corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.
Disclaimer. This page is generated from Patsnap Eureka data drawn from a limited snapshot of global patent and scientific-literature records, and is provided for general information and reference only.
Patent data carries inherent limitations: recent filings (typically the most recent 18–24 months) are under-counted due to standard publication lag; counts may be reported at either a patent-family or a patent-record basis and are not always directly comparable; classification, applicant-name, and citation data may contain errors, duplicates, or omissions; and the underlying search query defines and constrains the scope shown. As a result, the analysis may be incomplete or inaccurate and may not reflect the full technology landscape.
Nothing on this page constitutes an exhaustive prior-art, novelty, freedom-to-operate, or validity search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. Any patent, commercial, or strategic decision should be verified independently and reviewed with qualified patent, legal, and domain professionals. Patsnap makes no warranties, express or implied, as to the accuracy, completeness, or fitness for any particular purpose of the information presented.
Help us improve
Something wrong, out of date, or missing on this page? Tell us and it goes straight to the team that maintains it.
This page