一类新的周期为p3的GF(l)上广义割圆序列的线性复杂度 | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

一类新的周期为p3的GF(l)上广义割圆序列的线性复杂度

Identifier:nobleid.org/w1/20260515/F83CE607

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/F83CE607.svg?ark=w1%2F20260515%2FF83CE607)](https://nobleid.org/work/w1/20260515/F83CE607)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy