|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授,12篇TIT,今年才拿到博导资格,这水平不吊锤这个来养老的?
" g. r h+ S' A( r A3 ]8 e. ?Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
" S* D5 v4 |, x3 P+ DYi Kuang;+ e; U6 K c9 R w( o2 i
Songsong Li;
3 i+ o. k. Z7 D9 u2 _. I1 r$ {1 V1 TShu Liu;, G4 O" V# g L: s5 J, c
Liming Ma;
# x% B% a, W7 G, Q! V9 L6 L( }8 yChaoping Xing; t) h- m$ `/ Z; G+ _. R4 H! D& [1 v$ p
IEEE Transactions on Information Theory
2 N4 @" C1 e& C2 l/ yYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
x5 j5 J; @% B6 @0 G/ G" O2 Q8 i
Abstract" e6 b5 b- ^' e9 [& `3 m
HTML
3 t# l. O5 P- n% r- m% r7 D1 y c, i$ D
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
/ K f6 x B/ J, z/ ?Songsong Li;
4 d( q& d \5 x* V6 B" zShu Liu;
9 c) x4 D$ ^% a5 i) ]& p. s8 E" T. GLiming Ma;
1 u# W2 h% l2 z- v6 [6 V5 _Yunqi Wan;
! f7 O7 f4 Z* Y9 n/ q! {Chaoping Xing
, U( e6 B1 W& c9 I: _, JIEEE Transactions on Information Theory+ f, f z4 f8 g! L; o w, d8 A* k
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE
. s% w% X6 `3 p: d! z; @: M& \7 {6 G9 ?) K1 x t1 ^; ^
Abstract9 C$ ~$ u; `; d' W! L
HTML% M" e, ]5 j: ]
" Q* z8 T7 Z9 @' _/ y
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy2 Q& I2 Z4 X4 R6 e+ k( |
Shu Liu;
2 S8 N) z, q5 l0 m9 ~0 a* KIvan Tjuawinata;
7 V. i& b( x- d4 \( s- wChaoping Xing
" k( E4 q( _2 d! r8 ]IEEE Transactions on Information Theory2 X- V a8 @6 C+ T5 {
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE3 w+ k3 ]! P: V, H7 e/ C% ?0 O2 j& u
Cited by: Papers (4)
* v% R6 c8 C) g0 J0 }0 m6 q* N
1 b0 L5 M0 ~0 u3 q$ w& OAbstract
* r' u( u, O' a- ]6 {HTML/ ~6 E6 I4 r1 G E
7 d: g$ R( W' a; S0 m& L/ a
A Lower Bound on the List-Decodability of Insdel Codes
9 _5 @) M8 a) {Shu Liu;
5 N* s7 r" P- f! t" h& d( ]3 RIvan Tjuawinata;3 Z8 W3 G8 I( |% d0 d5 p, [6 O6 n
Chaoping Xing
# ]7 @' z% X; @: o$ DIEEE Transactions on Information Theory: d7 l+ M& T i2 C* e
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE6 A* M' ?0 E( \/ _' B# |
, M* i) V+ D* m1 n) J2 o8 F. c
Abstract( Y) C2 j. E' ?$ ?
HTML3 A! s8 k; x5 F3 d3 b: n
$ ?) L# J! w% O5 ?# B6 z* zA New Construction of Nonlinear Codes via Algebraic Function Fields
, l9 e5 f2 W' a& j( s" |7 `Shu Liu;
% f5 T; S3 ?! w; l# q4 `: GLiming Ma;
1 B+ y" O2 B; d; O* XTing-Yi Wu;9 `7 A% s! B6 e8 Y# h' O
Chaoping Xing6 e0 R. o" Z) T7 K% w0 B& E2 r
IEEE Transactions on Information Theory
$ P+ I' ]0 h' k. RYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
, g- B* Z) h# [ L( o cCited by: Papers (1): @& G8 M5 \" ^
3 R$ x0 N; e0 p! K8 y5 ]
Abstract+ F' b* c- P% `. i$ [
HTML
5 U* t" X: k. t9 T$ Z: ]5 F2 x8 ~ G7 P
3 n8 C! j# W) ]. g; g6 W# ]Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
* V2 A$ F% Y2 p6 P0 ~; y( o6 RShu Liu;
7 ^4 f: g8 i/ v# B! ?" Z# f' p7 kChaoping Xing
( Z7 O! I5 T& O3 O0 e3 h6 N2 cIEEE Transactions on Information Theory
$ R/ H9 h: ]: R E0 ~. X( ?" w% [Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
1 n( L' }8 ~% T' A* @7 oCited by: Papers (2)
) }' @/ C; y- h$ s; |3 |- ] n5 s ]
Abstract% g7 b9 e9 P5 {- y, N
HTML
4 W- r! x8 u- R$ _3 ?- [8 g+ B0 k5 r0 [, R* t2 Z# u( j5 z) D
Bounds and Constructions for Insertion and Deletion Codes' ^3 ^- i4 ]; W/ O9 C/ X
Shu Liu;
6 G+ y: I1 g% r8 H" S1 y* U: oChaoping Xing- @8 [9 |# I5 ~; ~
IEEE Transactions on Information Theory4 g9 _ u+ y/ s+ y- T
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE9 x9 t3 Q, ^8 ]: F$ Q
Cited by: Papers (14)& G& i$ H7 }. P' ]
! K7 c. W, s+ M+ A& V ^/ ?Abstract
9 ]: P8 c3 g/ _. J4 G4 \0 M& THTML, {/ {; H0 {8 ~
. l; N9 G" D0 b+ [
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation; y' c. h Z9 t- p
Shu Liu;
9 d% T1 B" d" o& g, M- y rIvan Tjuawinata;) J) o4 r) r) W; X
Chaoping Xing8 J$ Z, ^" a5 C' L
IEEE Transactions on Information Theory% x0 @8 J: [! B1 J
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE0 d8 a$ i& X. B% v% d' }( X
Cited by: Papers (6)# h: f, o# `8 T
5 R: M0 K* A! z l2 F# }
Abstract
9 w1 H; z y) P* l* R9 A4 q, vHTML f/ \ @7 B8 l3 [* O
7 X/ C! T; h0 B; @+ @% l
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
% y v% v( o0 x; I& W) H4 qTai Do Duc;! J* W: ]: \0 t
Shu Liu;% {: `8 d! \) ]% ^3 O/ ^( f. W% b
Ivan Tjuawinata;
/ w- z$ ]0 E' M" i' |' j) AChaoping Xing
- G) R2 H* k, }$ }2 tIEEE Transactions on Information Theory
3 n- |3 _6 X% w* W# F0 ZYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
; S2 B% K1 @. \( yCited by: Papers (17)
. C: U% Q( t0 S9 R4 q. z
6 `: s) L2 u G; C9 S) O7 z- fAbstract
4 f# p$ K2 V+ ^HTML
; z: H; g! ~% ^( }4 C" n3 ~* i( P7 w1 |% j: g
List Decodability of Symbol-Pair Codes
( q' G+ f& E/ B. P$ bShu Liu;
' ^" _0 x+ l+ E: ?5 ^% ]Chaoping Xing;
- o8 z6 M( K+ C0 ]Chen Yuan
# [3 S- p2 ?& N! yIEEE Transactions on Information Theory. z: d1 J7 m/ h& T
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE+ P# w. H' ~, O4 l, t1 W
Cited by: Papers (15)
$ Z$ Z r& i9 z+ w
# M e3 z5 A) x5 u" |: D& Z3 i3 @Abstract
& [( U% s A Y4 j6 l N' gHTML$ e; B* i; M- I e# X( y* O
$ F+ J& R( b- q3 a/ D- z3 ^- sList Decoding of Cover Metric Codes Up to the Singleton Bound
2 @3 p0 c5 q7 y, N) c, y2 H1 h/ b) `Shu Liu;
8 ^) q3 O* L3 v2 N6 P) i* gChaoping Xing;
% q& q) W. z. \' q3 @1 GChen Yuan; |- g3 C3 V6 X6 b s
IEEE Transactions on Information Theory
' Y* @. ^; n+ ^: P! OYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
! L' m9 I, `" |8 {% O- ?, KCited by: Papers (7)1 A9 z1 c* K0 ^) |, W
$ [ b: C r6 u3 `! O: ~+ _
Abstract
2 r3 D% d: B8 r. LHTML$ u. H7 |5 h6 q0 b+ ]
4 t" S8 a2 b+ d `; b: X
List Decodability of Random Subcodes of Gabidulin Codes
1 v3 _9 {% z# w3 K# L3 G& CShu Liu;
/ A j0 u3 G9 ?8 z2 \Chaoping Xing;; E+ W0 v* ?# `
Chen Yuan
+ j1 g. W6 B0 A$ V! nIEEE Transactions on Information Theory( C, S) \9 U- D* @3 S
Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
/ {' `6 v1 R3 SCited by: Papers (5)
7 U. m) x, J* X* f1 G |
|