NTTã¯2019å¹´5æ27æ¥ãçè«çãªé信容éã®ä¸éã§ãããã·ã£ãã³éçããéæãããã¤å®ç¾å¯è½ãªç¬¦å·åæ¹å¼ãéçºããã¨çºè¡¨ãããå称ã¯ãCoCoNuTSï¼Code based on Constrained Numbers Theoretically-achieving the Shannon limitï¼ãã5Gï¼ç¬¬5ä¸ä»£ç§»åéä¿¡ã·ã¹ãã ï¼ã®å®ç¨åãè¿«ããªããã6Gãã¨ãè¨ãã¹ã次ã ä¸ä»£éä¿¡ã«åããè¦ç´ æè¡ãæ©ãã姿ãè¦ãå§ããã ã·ã£ãã³éçã¨ã¯ãä¸å®ã®å¨æ³¢æ°å¸¯åå¹ ã«ãããé信容éã®ä¸éå¤ã®ãã¨ã決ã¾ã£ã帯åå¹ ã®éä¿¡è·¯ã¯é信容éã«éçããããã¨ããã·ã£ãã³ã®å®çãã¨å¼ã³ãæ°å¦è ã»é»æ°å·¥å¦è ã§ãæ å ±çè«ã®ç¶ãã¨å¼ã°ããã¯ãã¼ãã»ã·ã£ãã³ã証æããã 5Gã«å®è£ ããã¦ããLDPCï¼Low Density Parity Checkï¼ãªã©æ¢åã®ç¬¦å·åæ¹å¼ã¯ãç¹æ®ãªæ¡ä»¶ãæºããéä¿¡è·¯ã§ããã·ã£ã
{{#tags}}- {{label}}
{{/tags}}