|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？' I; h1 s9 f5 K
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity* c I% B' f9 Y {/ I& n: T
Yi Kuang;
& \( m+ U( c8 x4 {" o' q. W* TSongsong Li;
( z" Z( m0 N0 F0 o# Q o2 A5 BShu Liu;/ D9 N5 i7 n6 k/ v7 _1 x
Liming Ma;( J3 C/ u& I7 Z3 F6 U7 j% X7 G
Chaoping Xing1 l8 T! K7 I/ C1 h) X/ f, T0 a
IEEE Transactions on Information Theory
6 b1 B+ l, [6 u1 Y XYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE9 y0 x, P! f+ K* K2 M- D
! ~/ g6 h1 M: s xAbstract7 ]" [/ r( `# ?& \9 u/ y9 [( }
HTML( @4 |9 M! \% \3 i* [) T/ t2 E
$ a7 L& m5 e1 u: X' @3 D+ y$ P! M+ _
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
7 h1 l8 O8 e- P: ]( R# P6 ESongsong Li;
0 N r# H3 V4 l- J3 VShu Liu;4 Y% G8 A2 `, B$ P% I1 f+ o- A
Liming Ma;0 p( b7 M, m* E% M9 U6 E
Yunqi Wan; `+ B b$ q6 Q$ ~. d z+ h
Chaoping Xing
h! k) Y$ c) W9 x3 HIEEE Transactions on Information Theory
2 ^" \4 t+ n3 |' ]) C. tYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE/ C) n) `- b }* B( x- X
: ?. R4 o" y# X! Q
Abstract
2 e6 F* P! H7 e5 z5 w# s! J2 GHTML: a0 @$ ]$ Y1 ~3 G2 H: L
, V, }4 M& E" [, ]8 T1 j( Q
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy" ~: y4 \/ D% l' v4 H- c
Shu Liu;/ e/ f; I, o) V; L H/ X
Ivan Tjuawinata;' u* U$ p+ o% M+ G# }- }
Chaoping Xing
0 J3 \" H, ^6 S- o9 O XIEEE Transactions on Information Theory( ^# r/ v& M. o. p6 h9 I( s( @
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE
& \* ~- r5 U+ { sCited by: Papers (4)
- \/ c' a X5 E% O$ S8 W5 c1 G( u8 c3 j" x; z3 g4 o7 b$ {+ m2 ^
Abstract6 a; B/ v/ c. H4 A
HTML
: \, y$ g& Y- e, m' K
9 H+ d5 {' e' P0 P; MA Lower Bound on the List-Decodability of Insdel Codes9 \+ {. i7 r0 S$ h5 r" @0 L# y
Shu Liu;, R9 y! K0 J2 n" U7 S9 p
Ivan Tjuawinata;
7 H$ @; Z; k4 ~- T, k! kChaoping Xing
8 x; z! F! W0 DIEEE Transactions on Information Theory3 A& V) F8 U- m" x2 Y/ ]: P
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
, |6 x8 Q3 }- B( p: u; X- C2 h( k4 \$ e9 g& b
Abstract# ^- d. k, p5 J& G
HTML
# ], r6 _$ P }
: a' q' W% u' L" U a+ }% M3 Z* b% nA New Construction of Nonlinear Codes via Algebraic Function Fields4 ~6 _+ ]/ ?% Y4 d9 U5 P* ]1 o5 o4 k
Shu Liu;$ B6 b" _7 h6 e0 ~
Liming Ma;
. P) v& W$ s6 \% i$ RTing-Yi Wu;3 M$ E% v% B4 c3 u! h3 W2 Y
Chaoping Xing2 }1 |* U2 h7 W- B* ]
IEEE Transactions on Information Theory
& U4 C2 O( p& }& f+ s9 IYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE: Y r) Z- L5 u
Cited by: Papers (1)
, B7 a% X3 P+ S& q2 d; w! A1 C7 o! k' c( a
Abstract
- S9 K; {2 s$ ?HTML
( _7 X; `, d1 L" V
: R2 y8 V1 N' C9 m- M: p# n6 [5 ~Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
, ^5 j4 i/ f+ IShu Liu;
$ `# d3 R& L& Q, QChaoping Xing, O, {+ w6 S9 ~/ f4 `3 x
IEEE Transactions on Information Theory
) @, o) k4 Q, `! l9 l) u- ^) TYear: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE1 q2 `. ?( C8 ~3 T# {
Cited by: Papers (2)
$ E' K: r2 A8 X
: h" W1 A" f2 `; k' s3 \: ^Abstract, K+ y$ q# K2 @7 t1 B
HTML. H& G8 T2 A; h' N7 X5 C" H. L
- m6 q0 v! n" s. \; BBounds and Constructions for Insertion and Deletion Codes) M, l! G5 W7 f7 \+ r! d
Shu Liu;
( d( f7 |0 r7 M7 |/ sChaoping Xing
- o# W: I* N- G' ^ d; qIEEE Transactions on Information Theory/ f* Z! I! g5 T) H6 E+ h' ~
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE8 B0 v+ y8 t9 T" S: U
Cited by: Papers (14)' ?- P' |, t7 T5 i4 a9 J
6 `0 ?% H* e) d3 U5 s) P8 w: HAbstract
( W) z1 |, U a! O5 r1 {( v+ \HTML$ r6 e* F4 g3 t) N
0 G! t4 ]" y. i, n
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
9 g4 y: P2 J% M0 \, w6 U# _Shu Liu;4 V- a$ U8 @3 S+ J f' N$ h# A$ K
Ivan Tjuawinata;
4 |% K |2 k6 G, u) {0 bChaoping Xing$ {$ [5 D! v1 q3 [
IEEE Transactions on Information Theory$ `: V+ x5 W8 Z% F# d
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE; q. ~6 P7 A# b7 \) x" n
Cited by: Papers (6)
) A8 e b/ u- W2 q. y s7 t% ?
Abstract
. I3 a1 F5 u3 cHTML6 \2 p; |' }# o
3 @& ]; Y8 F( ?$ q4 `
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime: H3 F. h# o/ y1 E
Tai Do Duc;. H, T/ ]: a2 P4 v/ o
Shu Liu;! Q& `) x' _) X, m7 c' W! Z
Ivan Tjuawinata;4 S7 L, c- O7 a( f. J: J$ |( y* `
Chaoping Xing2 G& D& f8 i3 d" u5 O
IEEE Transactions on Information Theory) m8 m9 Z8 R& {+ D0 ~! h4 ]- d% {
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
6 f) H. C: z6 m) d. fCited by: Papers (17)
. D& b! f7 e4 P( V' {- t+ l& _. E9 E6 _( l6 \1 K4 {/ x# @3 v
Abstract' x! k+ S" e0 S0 g: x2 t9 ~
HTML! X2 u" F7 p& ?; y+ W
2 y X7 y% R4 U5 Z4 |List Decodability of Symbol-Pair Codes l( m0 t3 L8 Y5 u% K
Shu Liu;- U( t2 n9 f) r# _' o$ t" ~4 E
Chaoping Xing;
( C' ?, s) l0 nChen Yuan
9 {5 E2 h1 s+ S; d+ nIEEE Transactions on Information Theory: L4 G$ g- B* {+ F
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE$ s6 H7 q( g; S/ V4 q8 J
Cited by: Papers (15)0 k+ P" H; v" U5 U7 R7 J: P& Q
, I# F! P9 u$ g% |8 P/ }% s
Abstract
/ ~/ {' _$ n0 @) u6 e; oHTML
8 y+ y' a: u/ Y
( C S6 d; V, MList Decoding of Cover Metric Codes Up to the Singleton Bound
@* P, O' j2 l2 X. S1 VShu Liu; Y$ e' M/ P, m
Chaoping Xing;
9 m, s. ]. }9 P& ]# I* b" l9 `Chen Yuan! ], r) b( z( W2 ]
IEEE Transactions on Information Theory
8 G2 u, M& r+ g5 tYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
# v1 l; F* u5 l9 ^6 N% |% nCited by: Papers (7)
; ^' X: T4 y8 @# N L) s7 t% d. O( ~, V3 V* M' W
Abstract
" Q+ K R: G5 zHTML5 x+ V6 `1 Z0 c5 p1 B0 V! M- U$ ?
) U/ |$ Q3 W6 F4 ?List Decodability of Random Subcodes of Gabidulin Codes! B c* x$ i+ Y/ l
Shu Liu;1 n/ F' F4 }2 m) Q
Chaoping Xing;
# ^1 L4 N& z: |2 |2 Z5 T# o" WChen Yuan1 |' G' u! m' [0 u: F/ y7 s, h
IEEE Transactions on Information Theory
1 K* i7 X& T: j; u+ S' n# G4 Y+ T9 ~Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE. F# C! {, p# n7 W: K
Cited by: Papers (5)
& s1 ]' E% x- {, H, K8 y |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
