Jul 11, 2013 · Abstract:We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised ...

Jun 6, 2014 · We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised ...

Abstract. We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves ...

Jul 24, 2013 · We start by formulating in Section 2 our new bound at the level of affine variety codes and explain how it gives rise to an improved code ...

Oct 22, 2024 · We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} ...

The strength of the Feng–Rao bound — besides the fact that it improves on previous bounds such as the Goppa bound — is that it enables an improved code ...

An improvement of the Feng–Rao bound for primary codes · Mathematics. Designs, Codes and Cryptography · 2014.

We present a lower bound for the minimum distance of certain affine variety codes which is better than the Feng–Rao bound. We also introduce a minimum ...

In [16] Salazar, Dunn and Graham presented a clever improvement to the Feng–Rao bound for the minimum distance of dual codes which they name the advisory bound ...

We present a lower bound for the minimum distance of certain affine variety codes which is better than the Feng-Rao bound. We also introduce a minimum ...