Bounds on the Covering Radius of Some Classes of Codes Over R

Open Journal of Discrete Applied Mathematics
doi 10.30538/psrp-odam2019.0007
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Ptolemy Scientific Research Press

Related search

On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

SIAM Journal on Algebraic Discrete Methods
1987English

New Covering Radius of Reed-Muller Codes for T-Resilient Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Linear Programming Bounds for Codes via a Covering Argument

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

Coefficient Bounds for Some Classes of Starlike Functions

Pacific Journal of Mathematics
Mathematics
1975English

Two Classes of Repeat-Root Constacyclic Codes of Length pS Over the Ring

Information Technology Journal
2014English

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

2019English

Efficient Decoding of Some Classes of Binary Cyclic Codes Beyond the Hartmann-Tzeng Bound

2011English

Isomorphism Classes of Authentication Codes

Bulletin of the Australian Mathematical Society
Mathematics
2004English

Bounds on the Performance of Sphere Decoding of Linear Block Codes

2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy