blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2501047

EP2501047 - ENCODING METHOD, DECODING METHOD, AND CODER [Right-click to bookmark this link]
Former [2012/38]ENCODING METHOD, DECODING METHOD, CODER AND DECODER
[2018/29]
StatusNo opposition filed within time limit
Status updated on  08.11.2019
Database last updated on 22.08.2024
FormerThe patent has been granted
Status updated on  30.11.2018
FormerGrant of patent is intended
Status updated on  04.07.2018
FormerExamination is in progress
Status updated on  09.02.2018
Most recent event   Tooltip01.07.2022Lapse of the patent in a contracting state
New state(s): MK		published on 03.08.2022  [2022/31]
Applicant(s)For all designated states
Panasonic Intellectual Property Corporation of America
20000 Mariner Avenue, Suite 200
Torrance, CA 90503 / US
[2019/01]
Former [2014/30]For all designated states
Panasonic Intellectual Property Corporation of America
20000 Mariner Avenue
Suite 200
Torrance CA 90503 / US
Former [2012/38]For all designated states
Panasonic Corporation
1006, Oaza Kadoma Kadoma-shi
Osaka 571-8501 / JP
Inventor(s)01 / MURAKAMI, Yutaka
c/o Panasonic Corporation IPROC
7F Twin 21 OBP Panasonic Tower
2-1-61, Shiromi, Chuo-ku
Osaka-shi, Osaka 540-6207 / JP
 [2012/38]
Representative(s)Grünecker Patent- und Rechtsanwälte PartG mbB
Leopoldstraße 4
80802 München / DE
[2019/01]
Former [2012/38]Grünecker, Kinkeldey, Stockmair & Schwanhäusser
Leopoldstrasse 4
80802 München / DE
Application number, filing date10829720.112.11.2010
[2019/01]
WO2010JP06668
Priority number, dateJP2009026050313.11.2009         Original published format: JP 2009260503
JP2010015799112.07.2010         Original published format: JP 2010157991
JP2010017257730.07.2010         Original published format: JP 2010172577
JP2010023180714.10.2010         Original published format: JP 2010231807
[2012/38]
Filing languageJA
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2011058760
Date:19.05.2011
Language:JA
[2011/20]
Type: A1 Application with search report 
No.:EP2501047
Date:19.09.2012
Language:EN
[2012/38]
Type: B1 Patent specification 
No.:EP2501047
Date:02.01.2019
Language:EN
[2019/01]
Search report(s)International search report - published on:JP19.05.2011
(Supplementary) European search report - dispatched on:EP04.03.2014
ClassificationIPC:H03M13/19, H03M13/23
[2012/38]
CPC:
H03M13/1154 (EP,KR,RU,US); H03M13/1105 (KR,US); H03M13/1111 (EP,KR,US);
H03M13/13 (KR,US); H03M13/157 (RU,US); H03M13/23 (RU);
H04L1/0041 (US); H04L1/0057 (US) (-)
Designated contracting statesAL,   AT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MK,   MT,   NL,   NO,   PL,   PT,   RO,   RS,   SE,   SI,   SK,   SM,   TR [2012/38]
Extension statesBANot yet paid
MENot yet paid
TitleGerman:KODIERVERFAHREN, DEKODIERVERFAHREN, UND KODIERGERÄT[2018/29]
English:ENCODING METHOD, DECODING METHOD, AND CODER[2018/29]
French:PROCÉDÉ DE CODAGE, PROCÉDÉ DE DÉCODAGE, ET CODEUR[2018/29]
Former [2012/38]KODIERVERFAHREN, DEKODIERVERFAHREN, KODIERGERÄT UND DEKODIERGERÄT
Former [2012/38]ENCODING METHOD, DECODING METHOD, CODER AND DECODER
Former [2012/38]PROCÉDÉ DE CODAGE, PROCÉDÉ DE DÉCODAGE, CODEUR ET DÉCODEUR
Entry into regional phase24.04.2012Translation filed 
24.04.2012National basic fee paid 
24.04.2012Search fee paid 
24.04.2012Designation fee(s) paid 
24.04.2012Examination fee paid 
Examination procedure24.04.2012Examination requested  [2012/38]
22.09.2014Amendment by applicant (claims and/or description)
08.02.2018Despatch of a communication from the examining division (Time limit: M02)
17.04.2018Reply to a communication from the examining division
05.07.2018Communication of intention to grant the patent
23.10.2018Fee for grant paid
23.10.2018Fee for publishing/printing paid
23.10.2018Receipt of the translation of the claim(s)
Divisional application(s)EP18204534.4  / EP3474454
The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  08.02.2018
Opposition(s)03.10.2019No opposition filed within time limit [2019/50]
Fees paidRenewal fee
28.11.2012Renewal fee patent year 03
28.11.2013Renewal fee patent year 04
25.11.2014Renewal fee patent year 05
24.11.2015Renewal fee patent year 06
23.11.2016Renewal fee patent year 07
24.11.2017Renewal fee patent year 08
22.11.2018Renewal fee patent year 09
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU12.11.2010
AL02.01.2019
AT02.01.2019
CY02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
MC02.01.2019
MK02.01.2019
MT02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
[2022/31]
Former [2021/34]HU12.11.2010
AL02.01.2019
AT02.01.2019
CY02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
MC02.01.2019
MT02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2021/32]HU12.11.2010
AL02.01.2019
AT02.01.2019
CY02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
MC02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2021/26]AL02.01.2019
AT02.01.2019
CY02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
MC02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2020/36]AL02.01.2019
AT02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
MC02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2020/17]AL02.01.2019
AT02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
TR02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2020/13]AL02.01.2019
AT02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SI02.01.2019
SK02.01.2019
SM02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/52]AL02.01.2019
AT02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SK02.01.2019
SM02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/49]AL02.01.2019
AT02.01.2019
CZ02.01.2019
DK02.01.2019
EE02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RO02.01.2019
RS02.01.2019
SE02.01.2019
SK02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/48]AT02.01.2019
DK02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RS02.01.2019
SE02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/46]AT02.01.2019
ES02.01.2019
FI02.01.2019
HR02.01.2019
IT02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RS02.01.2019
SE02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/39]ES02.01.2019
FI02.01.2019
HR02.01.2019
LT02.01.2019
LV02.01.2019
NL02.01.2019
PL02.01.2019
RS02.01.2019
SE02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
IS02.05.2019
PT02.05.2019
Former [2019/38]ES02.01.2019
FI02.01.2019
LT02.01.2019
NL02.01.2019
PL02.01.2019
SE02.01.2019
BG02.04.2019
NO02.04.2019
GR03.04.2019
PT02.05.2019
Former [2019/37]ES02.01.2019
FI02.01.2019
LT02.01.2019
NL02.01.2019
PL02.01.2019
SE02.01.2019
NO02.04.2019
GR03.04.2019
PT02.05.2019
Former [2019/35]ES02.01.2019
FI02.01.2019
LT02.01.2019
NL02.01.2019
PL02.01.2019
SE02.01.2019
NO02.04.2019
PT02.05.2019
Former [2019/34]FI02.01.2019
LT02.01.2019
NL02.01.2019
SE02.01.2019
NO02.04.2019
PT02.05.2019
Former [2019/33]FI02.01.2019
LT02.01.2019
NL02.01.2019
NO02.04.2019
PT02.05.2019
Former [2019/30]NL02.01.2019
Documents cited:Search[I]  - FELTSTROM A J ET AL, "Time-varying periodic convolutional codes with low-density parity-check matrix", IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE PRESS, USA, (19990901), vol. 45, no. 6, ISSN 0018-9448, pages 2181 - 2191, XP002688351 [I] 1-15 * the whole document *
International search[A]JP2009177228  (PANASONIC CORP);
 [A]  - ALI EMRE PUSANE ET AL., "On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes", PROCEEDINGS OF THE IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2007 (ISIT 2007), pages 1221 - 1225, XP008155519

DOI:   http://dx.doi.org/10.1109/ISIT.2007.4557390
 [A]  - CHRISTIAN CARDINAL ET AL., "A New Approach for the Construction of Powerful LDPC Convolutional Codes", PROCEEDINGS OF THE IEEE VEHICULAR TECHNOLOGY CONFERENCE, 2008 (VTC SPRING 2008), pages 1176 - 1180, XP008155520

DOI:   http://dx.doi.org/10.1109/VETECS.2008.249
 [A]  - TAKAAKI KISHIGAMI ET AL., "LDPC-Convolutional Codes for E-MBS FEC", IEEE 802.16 BROADBAND WIRELESS ACCESS WORKING GROUP, IEEE C802.16M- 09/0162, (20090105), URL: http://wirelessman.org/tgm/contrib/C80216m-09_0162.doc, XP008155532
 [AP]  - DMITRI TRUHACHEV ET AL., "Distance Bounds for Periodically Time-Varying andTail-Biting LDPC Convolutional Codes", IEEE TRANSACTIONS ON INFORMATION THEORY, (201009), vol. 56, no. 9, pages 4301 - 4308, XP008155521

DOI:   http://dx.doi.org/10.1109/TIT.2010.2053873
by applicantJP2009246926
 JP2009260503
 JP2010157991
 JP2010172577
 JP2010231807
    - R. G. GALLAGER, "Low-density parity check codes", IRE TRANS. INFORM. THEORY, (1962), vol. IT-8, pages 21 - 28
    - D. J. C. MACKAY, "Good error-correcting codes based on very sparse matrices", IEEE TRANS. INFORM. THEORY, (199903), vol. 45, no. 2, pages 399 - 431
    - M. P. C. FOSSORIER, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices", IEEE TRANS. INFORM. THEORY, (200111), vol. 50, no. 8, pages 1788 - 1793
    - M. P. C. FOSSORIER; M. MIHALJEVIC; H. IMAI, "Reduced complexity iterative decoding of low density parity check codes based on belief propagation", IEEE TRANS. COMMUN., (199905), vol. 47, no. 5, pages 673 - 680
    - J. CHEN; A. DHOLAKIA; E. ELEFTHERIOU; M. P. C. FOSSORIER; X.-YU HU, "Reduced-complexity decoding of LDPC codes", IEEE TRANS. COMMUN., (200508), vol. 53, no. 8, pages 1288 - 1299
    - J. ZHANG; M. P. C. FOSSORIER, "Shuffled iterative decoding", IEEE TRANS. COMMUN., (200502), vol. 53, no. 2, pages 209 - 213
    - A. J. FELTSTROM; K. S. ZIGANGIROV, "Time-varying periodic convolutional codes with low-density parity-check matrix", IEEE TRANS. INFORM. THEORY, (199909), vol. 45, no. 6, pages 2181 - 2191
    - R. M. TANNER; D. SRIDHARA; A. SRIDHARAN; T. E. FUJA; D. J. COSTELLO JR., "LDPC block and convolutional codes based on circulant matrices", IEEE TRANS. INFORM. THEORY, (200412), vol. 50, no. 12, pages 2966 - 2984
    - H. H. MA; J. K. WOLF, "On tail biting convolutional codes", IEEE TRANS. COMMUN., (198602), vol. COM-34, no. 2, pages 104 - 111
    - C. WEIB; C. BETTSTETTER; S. RIEDEL, "Code construction and decoding of parallel concatenated tail-biting codes", IEEE TRANS. INFORM. THEORY, (200101), vol. 47, no. 1, pages 366 - 386
    - M. B. S. TAVARES; K. S. ZIGANGIROV; G. P. FETTWEIS, "Tail-biting LDPC convolutional codes", PROC. OF IEEE ISIT 2007, (200706), pages 2341 - 2345
    - G. MULLER; D. BURSHTEIN, "Bounds on the maximum likelihood decoding error probability of low-density parity check codes", IEEE TRANS. INF. THEORY, (200111), vol. 47, no. 7, pages 2696 - 2710
    - R. G. GALLAGER, "a simple derivation of the coding theorem and some applications", IEEE TRANS. INF. THEORY, (196501), vol. IT-11, no. 1, pages 3 - 18
    - A. J. VITERBI, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm", IEEE TRANS. INF. THEORY, (196704), vol. IT-13, no. 2, pages 260 - 269
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.