Search Results - combinatorial coding theory
-
1
Combinatorial Limitations of Average-Radius List-Decoding
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.10.2014Published in IEEE transactions on information theory (01.10.2014)“…We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ω p (log(1/γ…”
Get full text
Journal Article -
2
Upper Bound on List-Decoding Radius of Binary Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.03.2016Published in IEEE transactions on information theory (01.03.2016)“…Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with…”
Get full text
Journal Article -
3
Combinatorial neural codes from a mathematical coding theory perspective
ISSN: 1530-888X, 1530-888XPublished: United States 01.07.2013Published in Neural computation (01.07.2013)“… Here we take a new look at combinatorial neural codes from a mathematical coding theory perspective, examining the error correction capabilities of familiar receptive field codes (RF codes…”
Get more information
Journal Article -
4
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.05.2022Published in IEEE transactions on information theory (01.05.2022)“…The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in…”
Get full text
Journal Article -
5
Quantum Speedup of the Dispersion and Codebook Design Problems
ISSN: 2689-1808, 2689-1808Published: New York IEEE 2024Published in IEEE transactions on quantum engineering (2024)“…) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design…”
Get full text
Journal Article -
6
More About the Corpus of Involutions From Two-to-One Mappings and Related Cryptographic S-Boxes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.02.2023Published in IEEE transactions on information theory (01.02.2023)“…Permutation polynomials have been extensively studied for their applications in cryptography, coding theory, combinatorial design, etc…”
Get full text
Journal Article -
7
Separable Codes for the Symmetric Multiple-Access Channel
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.06.2019Published in IEEE transactions on information theory (01.06.2019)“… The well-known issue of the combinatorial coding theory is to obtain upper and lower bounds on the rate of <inline-formula> <tex-math notation="LaTeX">{s} </tex-math></inline-formula…”
Get full text
Journal Article -
8
Combinatorial methods in coding theory
ISBN: 1124744991, 9781124744995Published: ProQuest Dissertations & Theses 01.01.2011“… The underlying thread of our results is the use of diverse combinatorial methods originating in coding theory and computer science…”
Get full text
Dissertation -
9
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.04.2023Published in IEEE transactions on information theory (01.04.2023)“…Interplay between coding theory and combinatorial <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>-designs has been a hot topic for many years for combinatorialists and coding theorists…”
Get full text
Journal Article -
10
On-orbit codes of posets and operators in algebra
ISSN: 0925-9899, 1572-9192Published: New York Springer US 01.11.2025Published in Journal of algebraic combinatorics (01.11.2025)“…For a partition μ of a positive integer and a prime p , let A ( p , μ ) be a finite Abelian p -group, and let A ^ ( p , μ ) be its dual group. We define a…”
Get full text
Journal Article -
11
Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding
ISSN: 1099-4300, 1099-4300Published: Switzerland MDPI 09.03.2021Published in Entropy (Basel, Switzerland) (09.03.2021)“…) almost affine codes. Thus, a synergy among four fields, i.e., information theory, matroid theory, combinatorial design, and coding theory is developed, which may lead…”
Get full text
Journal Article -
12
Differential spectrum of a class of APN power functions
ISSN: 0925-1022, 1573-7586Published: New York Springer US 01.08.2023Published in Designs, codes, and cryptography (01.08.2023)“…APN power functions are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics…”
Get full text
Journal Article -
13
World Scientific Publishing: Breakthroughs on the Interplay Between Coding Theory and Combinatorial Designs
Published: Washington, D.C Targeted News Service 06.01.2022Published in Targeted News Service (06.01.2022)Get full text
Newsletter -
14
Kernels for storage capacity and dual index coding
ISSN: 0097-3165Published: Elsevier Inc 01.11.2025Published in Journal of combinatorial theory. Series A (01.11.2025)“… The study of this graph quantity is motivated by applications in distributed storage and by its intimate relations to the index coding problem from the area of network information theory…”
Get full text
Journal Article -
15
An Introduction to Algebraic and Combinatorial Coding Theory
ISSN: 0036-1445, 1095-7200Published: Philadelphia The Society for Industrial and Applied Mathematics 01.07.1978Published in SIAM review (01.07.1978)Get full text
Book Review Journal Article -
16
What's New and Exciting in Algebraic and Combinatorial Coding Theory?
ISBN: 142440505X, 9781424405053ISSN: 2157-8095Published: IEEE 01.07.2006Published in 2006 IEEE International Symposium on Information Theory (01.07.2006)“…Summary form only given, as follows. We will survey the fi eld of algebraic and combinatorial coding theory, in an attempt to answer the question in the title…”
Get full text
Conference Proceeding -
17
On the clique covering numbers of Johnson graphs: On the clique covering numbers of Johnson graphs
ISSN: 0925-1022, 1573-7586Published: New York Springer US 01.09.2025Published in Designs, codes, and cryptography (01.09.2025)“… By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight…”
Get full text
Journal Article -
18
Research on Universal Combinatorial Coding
ISSN: 2356-6140, 1537-744X, 1537-744XPublished: Cairo, Egypt Hindawi Publishing Corporation 01.01.2014Published in TheScientificWorld (01.01.2014)“… Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with the existing code methods…”
Get full text
Journal Article -
19
The complete differential spectrum of a class of power permutations over odd characteristic finite fields
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.11.2023Published in IEEE transactions on information theory (01.11.2023)“…Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics…”
Get full text
Journal Article -
20
Topics in coding theory and combinatorial structures
ISBN: 049673573X, 9780496735730Published: ProQuest Dissertations & Theses 01.01.2004“… Additionally, there is brief overview of combinatorial theory, such as: designs, finite geometry, and the theory of error-correcting codes that we need for our work…”
Get full text
Dissertation

