z-logo
open-access-imgOpen Access
On codes over the finite non chain ring A = F4+vF4; v2 = v and its covering radius of codes with Bachoc weight
Author(s) -
P. Chella Pandian
Publication year - 2019
Publication title -
international journal of algebra and statistics
Language(s) - English
Resource type - Journals
eISSN - 2314-4556
pISSN - 2314-4548
DOI - 10.20454/ijas.2019.1495
Subject(s) - radius , mathematics , ring (chemistry) , chain (unit) , combinatorics , repetition (rhetorical device) , block (permutation group theory) , geometry , physics , computer science , quantum mechanics , chemistry , organic chemistry , linguistics , philosophy , computer security
In this paper, some lower and upper bounds on the covering radius of codes over the nite non chain ring A = F4 + vF4; v2 = v with respect to Bachoc weight is given. Also, the covering radius of various Block Repetition Codes of same and different length over the nite non chain ring A = F4 + vF4; v2 = v is obtained.In this paper, some lower and upper bounds on the covering radius of codes over the nite non chain ring A = F4 + vF4; v2 = v with respect to Bachoc weight is given. Also, the covering radius of various Block Repetition Codes of same and different length over the nite non chain ring A = F4 + vF4; v2 = v is obtained.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom