|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授,12篇TIT,今年才拿到博导资格,这水平不吊锤这个来养老的?' y2 V q% \* W6 m, Q
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
4 ~+ v" d) N. P5 |. h% xYi Kuang;
+ l! w, Y5 n' }Songsong Li;
: L! M5 G) @4 g# XShu Liu;
$ | l; Q% J. [* \Liming Ma;0 [* F; L+ D! e1 X0 I, p4 N
Chaoping Xing
6 H6 U: i0 W; U+ SIEEE Transactions on Information Theory& \2 @& I. ?$ G, U) d
Year: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
6 A9 A- L" y# H3 j- ]% v$ }0 y1 B, k/ |, s5 r' ]# x% J
Abstract% k1 V- t3 A, e1 f. r
HTML
& f. k. L- L' S9 L3 W0 l1 y& h" d5 k% L+ v# ^7 _
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)6 H5 ^0 B6 n7 q( d4 v' y/ `
Songsong Li;. U2 b& V% z( ^# T. s+ C; z! g
Shu Liu;
- m) b! G! \6 CLiming Ma;& M" g% p/ u; m( b0 f; B
Yunqi Wan;: R1 W) @ J3 n* e- I
Chaoping Xing
/ |& ?6 a7 {4 V% NIEEE Transactions on Information Theory/ W8 m, n9 h/ n' C
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE
( x5 C& A% h# o! b3 _. a3 [/ Z n% b0 z* \1 U9 w
Abstract6 z) t1 X* s' I3 Y7 P" E
HTML& g2 V: L% o% Y0 x8 _+ g6 B
9 O; }1 c l; I8 d1 L) vExplicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
- v$ |1 b; y0 F1 S5 EShu Liu;
. ^3 ?' ?7 s8 x9 j: @* ]- jIvan Tjuawinata;
8 q$ d! Y1 B. K8 E/ t; hChaoping Xing0 \* B/ Q' k* ~
IEEE Transactions on Information Theory
: ]0 L1 ^* ]3 \9 W9 YYear: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE3 k1 O9 G0 T9 L `4 s- h7 w
Cited by: Papers (4)
! e9 D2 Q' V9 N$ t5 o( i |- S* ~) Q1 p) M# T1 V
Abstract, j, h* c8 c2 B: d4 W& p* U
HTML
& L1 Y4 r6 j( }- c
/ x3 X; p3 J U6 Y5 I4 zA Lower Bound on the List-Decodability of Insdel Codes7 c! U2 }% n! q* t
Shu Liu;/ p5 F% v3 T/ M W3 G4 w$ T
Ivan Tjuawinata;7 f+ Z- f4 o+ U) A# e( n- ~ M& Y. K
Chaoping Xing; f$ |3 |' O( {6 Z7 @! V
IEEE Transactions on Information Theory
* C% s Y: S N( T! K6 L2 p8 xYear: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE% U: M% u S* Q& B' X' @
: W/ `& @# w. W' ?7 ~. JAbstract1 S2 p& [* T& Z# ~, O2 C5 {3 g
HTML
! X) Z0 F( [0 C; Y9 @
: l1 D8 R% n+ m! e0 e5 C$ K" DA New Construction of Nonlinear Codes via Algebraic Function Fields
* k2 |6 R E4 f u0 oShu Liu;
% F# {+ O0 e3 y1 m4 n. pLiming Ma;
7 j$ F8 h# S7 ?: [: C' NTing-Yi Wu;* R z. ~' V2 N6 d. |2 I
Chaoping Xing
3 {4 N+ Y) K( b! f/ v3 g, \1 aIEEE Transactions on Information Theory
$ H0 h% e& M- p* g- N3 h) nYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
* i+ h$ X% r6 iCited by: Papers (1)
( Y: G4 r! T$ U- b, e
9 o8 r& p) O; M" ?+ UAbstract" I0 U3 k- R9 ~! Z( ^
HTML; L, V3 o! p& \3 n5 C! s9 E; m
5 M. G+ B% K+ e/ ~+ u
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
* o( d6 j8 |9 q3 |7 u, I& |* ZShu Liu;
3 n+ R% z. D5 _$ e, Z& m4 TChaoping Xing
: ]6 ~6 h! B* v( x; FIEEE Transactions on Information Theory" k% ~8 D9 N& y; i6 A6 n- h
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
! y3 J$ C9 ?0 b1 vCited by: Papers (2)
0 k$ b: Z; i& ]+ x% ]# r# m7 \$ C7 R. {& |
Abstract5 q' X( Q5 j. e! P
HTML
3 A! ^7 L, g* C7 C4 F3 A1 k7 B
* ?( A8 J( A# N' A2 M8 a- hBounds and Constructions for Insertion and Deletion Codes! l; A/ [+ E- x0 o' r- l
Shu Liu;
' P4 ]2 H1 c6 T B! L: y9 QChaoping Xing
7 A! `1 U( f$ W. NIEEE Transactions on Information Theory; k9 \& Z7 W: T: [
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
" |; S& F& J5 e2 w( F, p( B4 nCited by: Papers (14)& h- r8 S3 n! h) H, ?6 v# m( g& `3 [
9 |& G! \4 x2 D1 b$ U2 {Abstract6 E& O2 G8 g, b6 B" L! R* D
HTML& c+ T. s) e/ r5 e/ e6 C
6 b# P) q7 \3 \5 a- [
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
; M- M* o% `6 S( d! @Shu Liu;3 q' n) q: Z" Y8 m
Ivan Tjuawinata;
, r# R6 i& S, B3 p* u1 j8 BChaoping Xing
O2 k! _0 S3 _; p- |/ r8 wIEEE Transactions on Information Theory
% d, l; e0 `8 `. ~Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
; v' c9 K, U8 Z. o- m J/ @Cited by: Papers (6)
6 J- a" R! F0 F' @! C& B/ c% t! L4 i1 n, w- O# t5 c
Abstract3 ?: a: X) v# U5 }: w8 n8 p% B
HTML$ @+ i w5 }9 q
?( i9 B1 W$ p3 _
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime8 p. y0 c6 e7 z' T7 Z: |" G$ `
Tai Do Duc;
3 l: r d3 J% u( l- S0 w/ TShu Liu;
! z3 j5 c9 M6 ]Ivan Tjuawinata;/ P( a$ I& q0 U" _1 [- t
Chaoping Xing
8 |" u# N% {# c6 l. B* m* cIEEE Transactions on Information Theory
7 j; @: L% g2 |/ yYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
: @/ B8 u3 T9 }, e- Q4 DCited by: Papers (17)
, r: a. h1 x+ V+ e$ S& a
! o8 [ I: z. `$ DAbstract# T6 k) o3 l( i8 ]$ G8 Y
HTML
! W" `% Q) D0 R% E9 P) c7 i) @9 _) {2 ~
List Decodability of Symbol-Pair Codes
8 V' U6 n! ^& PShu Liu;
% A& G+ W7 [- [7 @. I3 [Chaoping Xing;
- [ w* n7 ?8 ?' }Chen Yuan
0 m8 L# |$ d7 h V F% nIEEE Transactions on Information Theory- N$ h) C8 m0 D$ | |/ d! ~
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE% A9 g1 }% b( K0 _0 ^4 B6 q
Cited by: Papers (15)
. y8 ~# \7 N- B% c, c! i* E
# T* N# p& M9 P+ uAbstract2 _% U/ n3 d- E | i, W X" R2 n; X
HTML/ p1 a5 G! `$ ~
7 o" d, X% R; W$ ]; K4 W
List Decoding of Cover Metric Codes Up to the Singleton Bound1 h8 L/ w* B! G" D& ?
Shu Liu;: y; I: S7 S9 p. O) r- m5 m+ c
Chaoping Xing;
- k( [% d9 N8 Q3 e4 }# \- S/ ^6 UChen Yuan/ |# H* u+ n2 x* ?0 L/ u x* l
IEEE Transactions on Information Theory! B* j+ ^/ M/ _# H/ L& Y# C
Year: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
8 u4 x X0 R# g/ V& B8 KCited by: Papers (7)/ M3 ^) i* a0 N4 |# }
' q6 S( B# t- O7 D+ j5 F2 p8 C
Abstract% ?1 M! X8 @' r! P/ g( S M$ p5 `0 k
HTML8 w4 M7 C }: L. n) f6 R" A
5 V# j" Y9 b; x! |$ N% n( ^; CList Decodability of Random Subcodes of Gabidulin Codes, S+ K+ f& n1 ^, x* @2 A+ d
Shu Liu;3 n3 g5 [, G) G" l; K- \- b
Chaoping Xing;
: r4 j; J) c. H: v4 W2 xChen Yuan
; b8 k3 d( ?, @IEEE Transactions on Information Theory
1 Q: b& E4 ?, HYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE; U3 d; `' C0 X+ j: U: \
Cited by: Papers (5)4 x- g9 Q" o+ C& z! c7 {% k5 k
|
|