BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Cumulative-Separable Codes

q-ary cumulative-separable $Γ(L,G^{(j)})$-codes $L=\{ α\in GF(q^{m}):G(α)\neq 0 \}$ and $G^{(j)}(x)=G(x)^{j}, 1 \leq i\leq q$ are considered. The relation between different codes from this class is demonstrated. Improved boundaries of the minimum distance and dimension are obtained.

5 nodes4 linksoverview previewCumulative-Separable Codes
SearchCollections
5 nodes4 links
Cumulative-Separable Codes5 visible / 5 total nodes / 5 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalWCumulative-Separable Codespreprint / 2010ASergey BezzateevResearcherANatalia ShekhunovaResearcherTInformation Theory6710 worksTmath.IT6610 works
PaperSignal 104 links

Cumulative-Separable Codes

preprint / 2010

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)