?
Lecture Notes in Computer Science (V. 10495, Proceedings of 5th International Castle Meeting on Coding Theory and Applications, 2017)
Vol. 10495.
Switzerland :
Springer, 2017.
Academic editor: V. Skachek, Á. Barbero, Ø. Ytrehus
This book constitutes the refereed proceedings of the 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, held in Vihula, Estonia, in August 2017.
The 24 full papers presented were carefully reviewed and selected for inclusion in this volume. The papers cover relevant research areas in modern coding theory, including codes and combinatorial structures, algebraic geometric codes, group codes, convolutional codes, network coding, other applications to communications, and applications of coding theory in cryptography.
Chapters
Egorova E., Kabatiansky G. A., , in: Lecture Notes in Computer Science (V. 10495, Proceedings of 5th International Castle Meeting on Coding Theory and Applications, 2017)Vol. 10495.: Switzerland: Springer, 2017. Ch. 8 P. 84–92.
We compare two popular tracing traitor schemes (1) using non-binary codes with identifiable parent property (IPP-codes) and (2) using family of sets with identifiable parent property. We establish a natural basis for comparing and show that the second approach is stronger than IPP-codes. We also establish a new lower bound on the cardinality of the ...
Added: March 11, 2018
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Qin X., Deng Y., Shchur L. et al., / Series arXiv "math". 2026. No. 2603.02962.
We perform a Monte Carlo analysis of the Ising model on many three-dimensional lattices. By means of finite-size scaling we obtain the critical points and determine the scaling dimensions. As expected, the critical exponents agree with the three-dimensional Ising universality class for all models. The irrelevant field, as revealed by the correction-to-scaling amplitudes, appears to ...
Added: April 20, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Kelbert M., Сухов Ю. М., М.: МЦНМО, 2025.
Для освоения таких разделов прикладной математики, как теория вероятностей, математическая статистика, теория информации и кодирование,
тренировка в решении задач и выработка интуиции важны не меньше, чем
изучение доказательств теорем; большое разнообразие задач по этому предмету затрудняет студентам переход от лекций к экзаменационным задачам,
а от них—к практике.
Этот том включает стандартный пакет информационно-теоретического материала, обычно читаемого на факультетах информатики ...
Added: February 9, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Kuninets A., Malygina E., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–5.
This paper presents explicit constructions of bases for Riemann-Roch spaces associated with arbitrary divisors on elliptic curves. In the context of algebraic geometry codes, the knowledge of an explicit basis for arbitrary divisors is especially valuable, as it enables efficient code construction. From a cryptographic point of view, codes associated with arbitrary divisors with many ...
Added: December 29, 2025
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Чернышов Д. П., Satanin A., Shchur L., / Series arXiv "math". 2025.
We investigate the boundary separating regular and chaotic dynamics in the generalized Chirikov map, an extension of the standard map with phase-shifted secondary kicks. Lyapunov maps were computed across the parameter space (K,K(α, τ)) and used to train a convolutional neural network (ResNet18) for binary classification of dynamical regimes. The model reproduces the known critical ...
Added: November 21, 2025
Rubchinskiy A., Chubarova D., / Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2025. No. WP7/2025/01.
The article examines one of the most famous examples of socio-economic systems, characterized by significant uncertainty – the S&P-500 stock market, where shares of 500 largest US companies are traded. No assumptions are made about the probabilistic characteristics of the stock market. A flexible algorithm for daily trading has been developed, based on both known fixed data ...
Added: November 9, 2025
Meshchaninov V., Strashnov, P., Shevtsov A. et al., / Cornell University. Серия CoRR, arXiv:2403.03726 "Computing Research Repository,". 2025.
Protein design requires a deep understanding of the inherent complexities of the protein universe. While many efforts lean towards conditional generation or focus on specific families of proteins, the foundational task of unconditional generation remains underexplored and undervalued. Here, we explore this pivotal domain, introducing DiMA, a model that leverages continuous diffusion on embeddings derived ...
Added: October 5, 2025
Shabalin A., Meshchaninov V., Vetrov D., / Series cs.CL, arXiv:2505.18853 "Computation and Language". 2025.
Diffusion models have achieved state-of-the-art performance in generating images, audio, and video, but their adaptation to text remains challenging due to its discrete nature. Prior approaches either apply Gaussian diffusion in continuous latent spaces, which inherits semantic structure but struggles with token decoding, or operate in categorical simplex space, which respect discreteness but disregard semantic ...
Added: October 5, 2025
Абрамов А. С., Chernyshev V. L., Mikhaylets E. et al., / Series Social Science Research Network "Social Science Research Network". 2025.
Computer vision is one of the most relevant modern research areas with broad practical applications. However, traditional solutions based on deep learning have signicant limitations and can be misleading. Topological data analysis, on the other hand, is a modern approach to solving similar problems using mathematically deterministic methods of algebraic topology that reduce the risk ...
Added: September 23, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 07600.
We demonstrate in an elementary way how to construct a frieze pattern of width m-3 from a partition of a convex m-gon
by not intersecting diagonals. ...
Added: September 17, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 20584.
We give a new proof of the following statement: the Catalan number C_n is divisible
by n+2, if n is odd and n<> 3k+1. ...
Added: September 9, 2025
Ivanashev Y., / Series Computer Science "arxiv.org". 2025.
Added: July 29, 2025
Puzachenko A. Y., Sandlerskiy R., Biology Bulletin 2023 Vol. 50 No. 2 P. S119–S131
We tried to trace the stages of Puzachenko scientific path and highlight the key areas of his scientific interest: the organization and functioning of complex self-organizing nonequilibrium systems (biogeocenosis and landscapes) and different aspects of biodiversity and relationships between species and their environment. ...
Added: February 26, 2025
Los A., Nesterenko A., Rogacheva O., В кн.: Алгебра, теория чисел, дискретная математика и многомасштабное моделирование: современные проблемы, приложения и проблемы истории. Материалы XXII Международной конференции, посвящённой 120-летию со дня рождения академика Андрея Николаевича Колмогорова и 60-летию со дня открытия школы-интерната № 18 при Московском университете.: [б.и.], 2023. С. 151–157.
One of the requirements for the quality of cryptographic algorithms is the equiprobable distribution of the characters of the sequence obtained after applying the cryptographic transformation. This requirement is due to the fact that in the presence of unequal probability of signs of the output sequence, it becomes possible to construct an effective method for ...
Added: April 24, 2024
Kirill Andreev, Ustinova D., Alexey Frolov, IEEE Wireless Communications Letters 2024 Vol. 13 No. 1 P. 69–73
We consider unsourced random access with MIMO receiver – a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel state information is unknown at transmitters and the receiver (no-CSI scenario). A comparison to the maximum-likelihood (ML) achievability bounds by Gao et al. ...
Added: January 22, 2024
Gromov V., Dang Q. N., , in: 10th International Conference, PReMI 2023, Kolkata, India, December 12–15, 2023, Proceedings. Pattern Recognition and Machine Intelligence. LNCS, volume 14301.: Cham: Springer, 2023. Ch. 3 P. 20–27.
Added: November 29, 2023
Kowshik S., Kirill Andreev, Frolov A. et al., IEEE Transactions on Communications 2020 Vol. 68 No. 8 P. 4694–4708
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding ...
Added: September 9, 2023
Glebov A., Rybin P., Kirill Andreev et al., IEEE Communications Letters 2023 Vol. 27 No. 9 P. 2313–2317
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We ...
Added: September 9, 2023
Kirill Andreev, Rybin P., Alexey Frolov, IEEE Transactions on Communications 2022 Vol. 70 No. 12 P. 7886–7898
We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. (2020) with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single-antenna quasi-static Rayleigh fading channel show that transition ...
Added: September 9, 2023