z-logo
open-access-imgOpen Access
Minimal cyclic codes of length 16p^n over GF(q), where q is prime or prime power of the form 16k+7
Author(s) -
Vishvajit Singh,
Manju Pruthi,
Jagbir Singh
Publication year - 2019
Publication title -
journal of mathematical and computational science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.12
H-Index - 2
ISSN - 1927-5307
DOI - 10.28919/jmcs/4247
Subject(s) - mathematics , prime (order theory) , cyclic group , prime power , modulo , primitive root modulo n , combinatorics , order (exchange) , integer (computer science) , discrete mathematics , arithmetic , computer science , abelian group , finance , economics , programming language

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