Table of Contents

• Permutation Decoding of Polar CodesMikhail Kamenev, Yulia Kameneva, Oleg Kurmaev, Alexey Maevskiy. 1-6 [doi]
• A Simplified Lower Bound on Minimum Distance of Convolutional Polar CodesRuslan Alexandrovich Morozov. 7-11 [doi]
• Design and Decoding of Polar Codes with a Mixture of Reed-Solomon and Arikan KernelsNikolai Iakuba, Peter Trifonov. 12-17 [doi]
• On the performance analysis of short LDPC codesLuiza R. Medova, Pavel S. Rybin, Ivan V. Filatov. 18-22 [doi]
• On the Hard-Decision Multi-Threshold Decoding of Binary and Non-Binary LDPC CodesAndrei Dzis, Pavel S. Rybin, Alexey A. Frolov. 23-26 [doi]
• On the Capacity Estimation of a Slotted Multiuser Communication Channel with NoiseFedor I. Ivanov, Pavel S. Rybin, Valentin B. Afanassiev, Alexey Kreschuk. 27-31 [doi]
• Error correcting coding schemes for a broadcast channelsVictor V. Zyablov, Vladimir G. Potapov. 32-35 [doi]
• Coded Multi-tone Transmission in a DHA FH OFDMA system employing order statisticsDmitry Osipov 0002. 36-41 [doi]
• On Minimal Distance between q-ary Plateaued FunctionsVladimir N. Potapov. 42-44 [doi]
• A Lower Bound on the Number of Boolean Functions with Median Correlation ImmunityVladimir N. Potapov. 45-46 [doi]
• Reconstructing Sets of Latin Squares, Linear and Equivalent to Linear CodesEvgeny V. Gorkunov, Vitaly R. Danilko. 47-51 [doi]
• New bounds for linear codes of covering radius 3 and 2-saturating sets in projective spacesAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco. 52-57 [doi]
• On Two Problems Concerning Universal Bounds for CodesPeter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova. 58-63 [doi]
• Trivariate Lifted Codes with Disjoint Repair GroupsNikita Polyanskii, Ilya Vorobyev. 64-68 [doi]
• Batch codes based on lifted multiplicity codesRina Polyanskaya, Nikita Polyanskii. 69-74 [doi]
• Load Balancing Performance in Distributed Storage with Regular Balanced RedundancyMehmet Fatih Aktas, Amir Behrouzi-Far, Emina Soljanin. 75-80 [doi]
• Unicast-Uniprior Index Coding Problems: Minrank and CriticalityNiranjana Ambadi. 81-86 [doi]
• Error Correction for Partially Stuck Memory CellsHaider Al Kim, Sven Puchinger, Antonia Wachter-Zeh. 87-92 [doi]
• New lower bound on the rate of traceability set systemsElena Egorova, Ilya Vorobyev. 93-98 [doi]
• Symmetric group testing with noiseElena Egorova. 99-103 [doi]
• On Maximum-Likelihood Decoding of Time-Varying Trellis CodesWenhui Li, Vladimir Sidorenko, Thomas Jerkovits, Gerhard Kramer. 104-109 [doi]
• The influence of active distances on the distribution of burstsAnastasiia Smeshko, Fedor I. Ivanov, Victor V. Zyablov. 110-114 [doi]
• Construction of the solution of the Chinese Remainder Theorem for polynomials using the method of undetermined coefficientsAndrey E. Krouk, Sergei Valentinovich Fedorenko. 115-116 [doi]
• New Class of Codes, Correcting Errors in the Lee MetricViacheslav Davydov. 117-120 [doi]
• Efficient Decoding of Interleaved Low-Rank Parity-Check CodesJulian Renner, Thomas Jerkovits, Hannes Bartz. 121-126 [doi]
• Interleaving Loidreau's Rank-Metric CryptosystemJulian Renner, Sven Puchinger, Antonia Wachter-Zeh. 127-132 [doi]
• On the Lightweight McEliece Cryptosystem for Low-Power DevicesFedor Ivanov, Evgenii Krouk, Alexey Kreshchuk. 133-138 [doi]
• Parallel Algorithms for Solving Sparse Binary Subset Sums Using Random MappingsNikita Rumenko, Alexander Kostyuck. 139-142 [doi]
• On the strength of asymmetric code cryptosystems based on the merging of generating matrices of linear codesVladimir M. Deundyak, Yu. V. Kosolapov. 143-148 [doi]
• Channel Models for Physical Unclonable Functions based on DRAM Retention MeasurementsSven Müelich, Sebastian Bitzer, Chirag Sudarshan, Christian Weis, Norbert Wehn, Martin Bossert, Robert F. H. Fischer. 149-154 [doi]
• Challenges beyond blockchain: scaling, oracles and privacy preservingStanislav Kruglik, Kamilla Nazirkhanova, Yury Yanovich. 155-158 [doi]
• Research of heuristic approaches for determining the tonality of text messages in natural language processing problemsEvgeniy Polyakov, Sergey Polyakov, Pavel Abramov. 159-164 [doi]
• End-to-end Deep Object Tracking with Circular Loss Function for Rotated Bounding BoxVladislav Belyaev, Aleksandra Malysheva, Aleksei Shpilman. 165-170 [doi]
• MAGNet: Multi-agent Graph Network for Deep Multi-agent Reinforcement LearningAleksandra Malysheva, Daniel Kudenko, Aleksei Shpilman. 171-176 [doi]
• Methodology of Mean Shift Clustering Algorithm Implementation Based on Dataflow ComputerSergey Salibekyan, Elena Ivanova, Andrey Vishnekov. 177-180 [doi]
• Curve Fitting for Error Rate DataAlexander B. Sergienko. 181-185 [doi]
• Computer Capacity As a Tool For the Processors Development AnalysisAnton Rakitskiy, Boris Ryabko. 186-190 [doi]
• DC Designer: Software System of Scaling Multiprovider Data Centers NetworksDmitry A. Perepelkin, Maria Ivanchikova. 191-194 [doi]
• SDN Cluster Constructor: Software Toolkit for Structures Segmentation of Software Defined NetworksDmitry A. Perepelkin, Ilya Tsyganov. 195-198 [doi]
• Data Delivery Efficient Spreading Factor Allocation in Dense LoRaWAN DeploymentsOleg Gusev, Andrey M. Turlikov, Semyon Kuzmichev, Nikita Stepanov. 199-204 [doi]
• Study of the energy consumption of graphical interfaces on TFT displaysAlexey Rolich, Elizaveta Fedotova, Sofia Saprykina. 205-210 [doi]
• Gradient Cryptanalysis of Block Cipher CHAM 64/128Boris Ryabko, Alexander Soskov, Andrey Fionov. 211-215 [doi]
• Application of list decoding of convolutional codes in steganographyKlim Kireev, Grigorii Melnikov, Edgar Kaziakhmedov. 216-218 [doi]
• Transparent E-Voting dApp Based on Waves Blockchain and RIDE LanguageNazim Faour. 219-223 [doi]
• Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay ConstraintsArtem Burkov, Alexey A. Frolov, Pavel S. Rybin, Andrey M. Turlikov. 224-227 [doi]