{"id":58,"date":"2022-11-04T16:01:31","date_gmt":"2022-11-04T07:01:31","guid":{"rendered":"https:\/\/isita.ieice.org\/2024\/recentresultsposters\/"},"modified":"2026-07-03T17:30:43","modified_gmt":"2026-07-03T08:30:43","slug":"recentresultsposters","status":"publish","type":"page","link":"https:\/\/isita.ieice.org\/2026\/recentresultsposters\/","title":{"rendered":"Recent Results Posters"},"content":{"rendered":"\r\n<p>Interested authors are invited to submit their most recent results in information theory and its applications, on topics including, but not limited to:<\/p>\r\n<table style=\"font-size: 14px; width: 695px;\" border=\"0\" cellspacing=\"0\" cellpadding=\"0\" align=\"center\">\r\n<tbody>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Coding for Storage<\/td>\r\n<td style=\"width: 312px;\">\u2022\u00a0 Network Coding and Applications<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Coding Theory<\/td>\r\n<td style=\"width: 312px;\">\u2022 Pattern Recognition and Machine Learning<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Communication Theory<\/td>\r\n<td style=\"width: 312px;\">\u2022 Quantum Information and Coding Theory<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Computation and Complexity in Information Theory<\/td>\r\n<td style=\"width: 312px;\">\u2022 Sequences<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Cryptography and Information-Theoretic Security<\/td>\r\n<td style=\"width: 312px;\">\u2022 Shannon Theory<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Data Privacy and Security<\/td>\r\n<td style=\"width: 312px;\">\u2022 Signal Processing<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Deep Learning in Information Theory<\/td>\r\n<td style=\"width: 312px;\">\u2022 Source Coding and Data Compression<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 Distributed Coding and Computation<\/td>\r\n<td style=\"width: 312px;\">\u2022 Sparsity and Compressed Sensing<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\"><span style=\"font-size: 14px;\">\u2022\u00a0<\/span>Estimation and Detection<\/td>\r\n<td style=\"width: 312px;\"><span style=\"font-size: 14px;\">\u2022\u00a0<\/span>Statistical Inference and Learning<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\"><span style=\"font-size: 14px;\">\u2022\u00a0<\/span>Group Testing<\/td>\r\n<td style=\"width: 312px;\"><span style=\"font-size: 14px;\">\u2022\u00a0Statistical Physics for Information Theory<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\"><span style=\"font-size: 14px;\">\u2022\u00a0<\/span>Information Hiding<\/td>\r\n<td style=\"width: 312px;\"><span style=\"font-size: 14px;\">\u2022\u00a0<\/span>Statistics and Information Geometry<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\"><span style=\"font-size: 14px;\">\u2022\u00a0Information Theory for Biology<\/span><\/td>\r\n<td style=\"width: 312px;\"><span style=\"font-size: 14px;\">\u2022 Wireless Communications and Networks\u00a0<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"width: 376px;\">\u2022 \u00a0Information Inequalities<\/td>\r\n<td style=\"width: 312px;\">\u00a0<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<h2><span style=\"color: #007aa6;\">Schedule<\/span><\/h2>\r\n<p>To be announced<\/p>\r\n<!--\r\n<p><strong>Submission deadline:\u00a0<\/strong><s>August 31, 2022\u00a023:59 UTC<\/s><strong>\u00a0<strong>\u00a0September 11, 2022 23:59 UTC\u00a0<span style=\"color: #ff0000;\">(the deadline is extended)<\/span><\/strong><\/strong><\/p>\r\n<p><strong>Acceptance notification: <\/strong><s>September 7, 2022<\/s><strong> \u00a0September 20, 2022<\/strong><\/p>\r\n<p>Authors who wish to present their work in the recent results poster session and to have their abstract included in the symposium proceedings should submit a one-page abstract on <a href=\"https:\/\/edas.info\/newPaper.php?c=29279&amp;track=110065\">EDAS<\/a>. --<span style=\"color: #000000; font-family: Roboto, Arial, Helvetica, sans-serif; font-size: 14px;\">--- open\u00a0from\u00a0July 19,\u00a0 2022.<\/span><\/p>\r\n<p>Authors should use the same format as for regular ISITA papers, but with one page only. Note that a submitted abstract should be a final version; no revisions will be considered. Formatting errors may lead to rejection.<\/p>\r\n<p>The program committee will screen and approve submissions based on the relevance and the timeliness of the result. Poster abstracts will not appear in IEEE Xplore.<\/p>\r\n--><!--\r\n<h2>For Presenters of the Poster Session<\/h2>\r\n<p>To avoid possible congestion and untraceable people contacts in the poster displaying area, we do not have designated \u201ccore time\u201d for presenters to stand at posters. Instead, we will have \u201cposter review sessions\u201d in which presenters of posters give very short talks (five-minutes presentation each, no discussion time) on their poster contents. Therefore, a presenter is requested to prepare (1) a poster for display, and (2) a short presentation material (slides).<\/p>\r\n<p><strong><span style=\"font-size: 16px;\"><span style=\"caret-color: #000000; color: #000000; font-family: Helvetica;\">Each presenter shall prepare<\/span><\/span><\/strong><\/p>\r\n<ol>\r\n<li>a poster for display: A presenter is provided a poster board that can accommodate a A0 poster in the portrait orientation, i.e., 841-mm (width) x 1189-mm (height) or 33.11-inch (width) x 46.81-inch (height). A presenter is also requested to bring pushpins for stacking the poster.<\/li>\r\n<li>slides for a short talk: A presenter is requested to deliver a short talk for introducing the poster contents. Check the schedule of Poster Review Sessions and prepare slides and a PC for the presentation. The talk must be five-minutes or shorter, and we do not have question &amp; discussion time in the Poster Review Session.<\/li>\r\n<\/ol>\r\n<p>&nbsp;<\/p>\r\n--><!-- \u25b2 \/\/article\/\/div[@class='field-item even'] --><!-- \u25b2 \/\/div[@id='container']\/\/div[@class='sp-content'] -->","protected":false},"excerpt":{"rendered":"<p>Interested authors are invited to submit\u2026<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-58","page","type-page","status-publish","hentry"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/pages\/58","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/comments?post=58"}],"version-history":[{"count":6,"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/pages\/58\/revisions"}],"predecessor-version":[{"id":397,"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/pages\/58\/revisions\/397"}],"wp:attachment":[{"href":"https:\/\/isita.ieice.org\/2026\/wp-json\/wp\/v2\/media?parent=58"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}