Assignee
WU YINGQUAN
US·12 granted patents·2 pending applications·117 citations·filing 2008–2019
Top patents by PatentIndex Score
14 records- 0196US8503238B1Error recovery for flash memoryWU YINGQUAN·Filed 2011·Granted Aug 6, 2013·36 cites·19 claims
- 0294US8245117B1Low complexity chien search in chase-type decoding of reed-solomon codesWU YINGQUAN·Filed 2009·Granted Aug 14, 2012·33 cites·20 claims
- 0385US8674860B2Combined wu and chase decoding of cyclic codesWU YINGQUAN·Filed 2012·Granted Mar 18, 2014·9 cites·20 claims
- 0479US8850298B2Combined Koetter-Vardy and Chase decoding of cyclic codesWU YINGQUAN·Filed 2012·Granted Sep 30, 2014·6 cites·20 claims
- 0579US8132081B1Binary BCH decodersWU YINGQUAN·Filed 2008·Granted Mar 6, 2012·9 cites·19 claims
- 0676US8161360B1Integrated interleaved codesWU YINGQUAN·Filed 2008·Granted Apr 17, 2012·9 cites·23 claims
- 0773US8327241B2Reduced processing in high-speed Reed-Solomon decodingWU YINGQUAN·Filed 2010·Granted Dec 4, 2012·4 cites·21 claims
- 0869US8335974B2Binary BCH decodersWU YINGQUAN·Filed 2012·Granted Dec 18, 2012·3 cites·16 claims
- 0965US8171368B1Probabilistic transition rule for two-level decoding of reed-solomon codesWU YINGQUAN·Filed 2008·Granted May 1, 2012·5 cites·19 claims
- 1062US10897270B2Dynamic dictionary-based data symbol encodingWU YINGQUAN·Filed 2019·Granted Jan 19, 2021·1 cites·13 claims
- 1161US8650466B2Incremental generation of polynomials for decoding reed-solomon codesWU YINGQUAN·Filed 2010·Granted Feb 11, 2014·2 cites·21 claims
- 1250US10671306B2Chunk-based data deduplicationWU YINGQUAN·Filed 2018·Granted Jun 2, 2020·0 cites·25 claims
- 1342US2013343131A1Fast tracking for flash channelsWU YINGQUAN·Filed 2012·Application pending·0 cites
- 1438US2019377804A1Data compression algorithmWU YINGQUAN·Filed 2018·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when WU YINGQUAN files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Counts cover granted patents and pending applications in the PatentIndex corpus. How scoring works →