◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Shahabinejad

2 papers hereh-index 8188 citations33 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.IT2

identity via Semantic Scholar / OpenAlex

most citedOptimal Locally Repairable Codes with Improved Update Complexity

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.IT2017

On the Average Locality of Locally Repairable Codes

Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani

A linear block code with dimension k, length n, and minimum distance d is called a locally repairable code (LRC) with locality r if it can retrieve any coded symbol by at m…

cs.IT2016★ 1 cited

Optimal Locally Repairable Codes with Improved Update Complexity

Mehrtash Mehrabi, Mostafa Shahabinejad, Masoud Ardakani +1

For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repai…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.