Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Efficient hard decision decoding of generalized Reed-Solomon codes in presence of erasures and errors within the singleton bound

Efficient hard decision decoding of generalized Reed-Solomon codes in presence of erasures and errors within the singleton bound

US Patent 11855658 · Granted Dec 26, 2023

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Computational storage acceleration using DRAM sharing between SSD in all-flash a2025
Anti-malware algorithm and HW/FW for internal SSD health and storage space prote2025
Reviving faulty NAND by AI data modulation2025
Fast combined chase and GMD decoding of generalized Reed-Solomon codes2025
Fast combined chase and GMD decoding of generalized Reed-Solomon codes2025
Fast combined chase and GMD decoding of generalized Reed-Solomon codes2025
Setting optimal threshold voltages for reading data from a memory device based o2025
Setting optimal threshold voltages for reading data from a memory device based o2025
Generalized hierarchical concatenated codes with fixed dimension and code length2025
Generalized hierarchical concatenated codes with fixed dimension and code length2025
Generalized hierarchical concatenated codes with fixed dimension and code length2025
Generalized hierarchical concatenated codes with fixed dimension and code length2025