X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (38) 38
Conference Proceeding (8) 8
Book / eBook (2) 2
Book Chapter (1) 1
Government Document (1) 1
Magazine Article (1) 1
Publication (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
plotkin bound (27) 27
engineering, electrical & electronic (14) 14
mathematics (13) 13
computer science, information systems (12) 12
mathematics, applied (11) 11
codes (9) 9
decoding (9) 9
hamming distance (8) 8
information theory (8) 8
error correction codes (6) 6
upper bound (6) 6
combinatorics (5) 5
computer science, theory & methods (5) 5
data structures, cryptology and information theory (5) 5
error probability (5) 5
error-correcting codes (5) 5
homogeneous weight (5) 5
plotkin construction (5) 5
research (5) 5
algorithms (4) 4
binary codes (4) 4
coding theory (4) 4
construction (4) 4
error correction (4) 4
galois rings (4) 4
information and communication, circuits (4) 4
johnson bound (4) 4
linear codes (4) 4
maximum likelihood decoding (4) 4
optimization (4) 4
polynomials (4) 4
reed-muller codes (4) 4
analysis (3) 3
binary system (3) 3
block codes (3) 3
coding and information theory (3) 3
conferences (3) 3
cryptography (3) 3
data encryption (3) 3
discrete mathematics in computer science (3) 3
frobenius rings (3) 3
galois fields (3) 3
hadamard matrix (3) 3
information technology (3) 3
linear programming bound (3) 3
lower bounds (3) 3
orthogonal arrays (3) 3
recursive (3) 3
reed-solomon codes (3) 3
11k45 (2) 2
94b65 (2) 2
algebra (2) 2
algorithm design and analysis (2) 2
asymptotic properties (2) 2
binary erasure channel (2) 2
blockcode (2) 2
bounds (2) 2
channels (2) 2
code construction (2) 2
codes over rings (2) 2
communication channels (2) 2
computer science (2) 2
computer simulation (2) 2
constant-composition code (2) 2
constant-weight code (2) 2
decoders (2) 2
elias bound (2) 2
error analysis (2) 2
extremal graph (2) 2
finite (2) 2
generalized plotkin bound (2) 2
gilbert-varshamov bound (2) 2
hirsch-plotkin radical (2) 2
history (2) 2
homogeneous weights (2) 2
identifying code (2) 2
information systems (2) 2
lattices (2) 2
mathematical analysis (2) 2
mathematical models (2) 2
modified plotkin bound (2) 2
ordered orthogonal arrays (2) 2
orthogonal array (2) 2
physics (2) 2
probability (2) 2
r-wise hamming distance (2) 2
recursive algorithms (2) 2
recursive decoding (2) 2
reliability theory (2) 2
simplex code (2) 2
strongly regular graph (2) 2
travel (2) 2
unequal error protection codes (2) 2
upper bounds (2) 2
varshamov-gilbert bound (2) 2
weak flip codes (2) 2
线性码 (2) 2
-net (1) 1
-nets (1) 1
05e30 (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


IEEE Transactions on Information Theory, ISSN 0018-9448, 11/2016, Volume 62, Issue 11, pp. 6315 - 6327
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 11/2011, Volume 57, Issue 11, pp. 7605 - 7613
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 01/2007, Volume 53, Issue 1, pp. 411 - 415
Journal Article
Designs, Codes and Cryptography, ISSN 0925-1022, 11/2010, Volume 57, Issue 2, pp. 169 - 179
Journal Article
Finite Fields and Their Applications, ISSN 1071-5797, 07/2018, Volume 52, pp. 174 - 199
We consider distance functions on a quotient module induced by distance functions on a module . We define error-correction for codes in with respect to induced... 
Network error-correction | Homogeneous weight | Plotkin bound | Elias bound | Coherent networks | Finite Frobenius ring | Network code | MATHEMATICS, APPLIED | EXTENSION THEOREM | LINEAR CODES | CODING THEORY | MATHEMATICS | FINITE | FROBENIUS RINGS | BOUNDS | MULTICAST | CONSTRUCTION
Journal Article
by Sole, P and Sison, V
IEEE Transactions on Information Theory, ISSN 0018-9448, 06/2007, Volume 53, Issue 6, pp. 2270 - 2273
In this correspondence, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(p r ,m), with... 
Convolutional codes | Plotkin bound | Hamming distance | Conferences | Galois rings | Lattices | Entropy | Decoding | homogeneous weight | Galois fields | MPEG 4 Standard | Upper bound | Block codes | Electronics | Information technology | Coding standards | Information systems
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2004, Volume 289, Issue 1, pp. 11 - 24
Homogeneous weight functions were introduced by Heise and Constantinescu (Lineare Codes über Restklassenringen ganzer Zahlen und ihre Automorphismen bezüglich... 
Plotkin bound | Gilbert–Varshamov bound | Frobenius rings | Homogeneous weights | Elias bound | Codes over rings | Ring codes | Sphere packing bound | Gilbert-varshamov bound | MATHEMATICS | homogeneous weights | Gilbert-Varshamov bound | sphere | codes over rings | packing bound | LEE-CODES | ring codes
Journal Article
Journal of Information and Optimization Sciences, ISSN 0252-2667, 11/2017, Volume 38, Issue 8, pp. 1311 - 1324
In this paper we propose an explicit construction of a new class of binary 2-frameproof code of size 4(9+9n) and length 4(4+3n), n≥1. For this new class of... 
Plotkin Bound | Error Correcting Code | Frameproof Code
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 11/2003, Volume 49, Issue 11, pp. 3010 - 3016
A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In... 
Hadamard matrix | Simplex code | Plotkin bound | Constant-composition code | Constant-weight code | Code construction | Johnson bound
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 01/2001, Volume 47, Issue 1, pp. 352 - 355
Journal Article
by Luo, Y and Fu, FW and Vinck, AJH and Chen, W
IEEE TRANSACTIONS ON INFORMATION THEORY, ISSN 0018-9448, 11/2003, Volume 49, Issue 11, pp. 3010 - 3016
A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In... 
Plotkin bound | WEIGHT CODES | COMPUTER SCIENCE, INFORMATION SYSTEMS | code construction | ENGINEERING, ELECTRICAL & ELECTRONIC | Hadamard matrix | ERROR-CORRECTING CODES | LOWER BOUNDS | constant-weight code | Johnson bound | GENERALIZED HADAMARD MATRICES | CONSTRUCTIONS | simplex code | constant-composition code
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 06/2007, Volume 53, Issue 6, pp. 2270 - 2273
Journal Article
by Sole, P and Sison, V
IEEE TRANSACTIONS ON INFORMATION THEORY, ISSN 0018-9448, 06/2007, Volume 53, Issue 6, pp. 2270 - 2273
In this correspondence, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(p(r), m), with... 
Plotkin bound | Q-ARY IMAGE | FINITE | Galois rings | FROBENIUS RINGS | COMPUTER SCIENCE, INFORMATION SYSTEMS | homogeneous weight | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
Journal Article
2017 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo), 09/2017, pp. 1 - 4
Article justifies a term of "assessment of information efficiency of error-correcting codes". It describes a model of descrete communication channel with... 
Reed-Solomon codes | Varshamov-Gilbert bound | Plotkin bound | Shannon bound | error-correcting codes | information efficiency | Communication channels | Reliability theory | Parity check codes | Decoding | binomial distribution
Conference Proceeding
Quantum Information Processing, ISSN 1570-0755, 1/2015, Volume 14, Issue 1, pp. 165 - 182
Journal Article
Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 2014, Volume 16, Issue 1, pp. 73 - 88
  Let G=(V,E) be an undirected graph without loops and multiple edges. A subset C⊆V is called identifying if for every vertex x∈V the intersection of C and the... 
Plotkin bound | Strongly regular graph | Extremal graph | Identifying code | Combinatorics | Graphs | Theorems | Mathematics
Journal Article
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, ISSN 1462-7264, 2014, Volume 16, Issue 1, pp. 73 - 88
Let G = ( V, E) be an undirected graph without loops and multiple edges. A subset C subset of V is called identifying if for every vertex x is an element of V... 
COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | Plotkin bound | MATHEMATICS, APPLIED | CODES | strongly regular graph | identifying code | extremal graph
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.